![](data:image/svg+xml;utf8,<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" viewBox="0 0 72 71" width="72"></svg>)
The symbols "∪, ∩" are used to indicate "or, and, not" respectively （pq）((p∪q)∩～(p∩q)) How to prove
Prove ～ (PQ) ～ ((P → q) ∩ (Q → P))
((～p∪q)∩(～q∪p))
p∪q)∪～q∪p))
(p∩～q)∪(q∩～p)
(p∪q)∩(p∩～p)∩(～q∩q)∩(～q∩～p)
(p∪q)∩(～q∩～p)
(p∪q)∩～(p∩q)
If there are three people in group A and two people in group B, there is a binary relationship between a and B
Problem solving ideas trouble also write
2*2*2=8
((PVQ) implies R) implies P, finding disjunctive normal form,
On the first floor, how does the formula after the second equal sign transform into the formula after the third equal sign? I can't understand this all the time
The disjunctive normal form is not unique, but the main disjunctive normal form is unique. ((P ∪ q) → R) → P = ((P ∪ q) → R) → P = ~ (P ∪ q) ∪ R) ∪ P = (P ∪ q) ∩ R) ∪ P = ((P ∩ R) ∪ (Q ∩ R)) ∪ P (disjunctive normal form) = (Q ∩ R)) ∪ P (also
RELATED INFORMATIONS
- 1. Let a = {1,2,3,4,5}, the partial order relation on A. r = {,,,} ∨ IA (1) make the Haas diagram of partial order relation R (2) let B = {1,2,3,4,5} find the maximum, minimum element, maximum, minimum distance, upper bound, infimum, lower bound and infimum of B The second question is {1,2,3,5}. Wrong number
- 2. Let the adjacency matrix a be used to represent the storage structure of the digraph g, then the degree of the vertex i of the digraph G is () The sum of the number of 0 elements in column I of a The sum of the number of 0 elements in line I of B The sum of the number of non-zero elements in column I of C The sum of the number of non-zero elements in line I of D
- 3. Find a source code requirements to display the graph adjacency matrix graph adjacency table, breadth of depth first traversal minimum spanning tree prim algorithm kruscal algorithm graph connectivity 1. Display graph adjacency matrix, graph adjacency table, depth first traversal, breadth first traversal, minimum spanning tree prim algorithm, minimum spanning tree kruscal algorithm, connected component of graph 2. When the user selects the wrong function, the system will output the corresponding prompt 3. Through the realization of graph operation, abstract some concrete things in real life
- 4. If the matrix AB = 0, then a = 0 or B = 0? Is it correct If not, why not? It's better to have counter examples
- 5. Is this the simplest form of row ladder matrix? A=0 -2 1 0 0 0 3 0 -2 0 0 0 -2 3 0 0 0 0 It can be reduced to 0 - 21 100 0 0 0 0 -1 0 0 0 0 0 0 1 Can continue to be transformed into 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 or 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 According to the definition of row ladder minimalist matrix: all the elements under the ladder are 0, and the number of steps is the number of non-zero rows. The first element behind the vertical line of the ladder is non-zero, which is also the first non-zero element of the non-zero row, and all other elements in its column are 0. * * * the row minimalist matrix of a matrix is uniquely determined*** All the above matrices meet the above definition, but the asterisk says that the only way to be sure is to have only one. Why? Is it not the simplest form if it can be simplified again? But the simplest answer is: 1 0 0 6 3 4 0 1 0 4 2 3 0 0 1 9 4 6 If 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 In the simplest form, isn't that a contradiction? ***If we want to change it into the simplest form of row, we must only carry out "row elementary transformation" instead of "column elementary transformation"? *** Thank you for your serious answer. If you have the Tongji version 4, you can see that the last element in line 2 of p61 example 1 is indeed - 2
- 6. Is the last line of the row ladder matrix all zero? It's written in the book, but I don't know what's going on. Is it a convention? It's not stated in the definition,
- 7. How to define the relations of equivalence, similarity and contract of matrix? What are their conditions
- 8. What is the difference between square matrix and matrix? What is the multiplication rule of matrix? RT
- 9. Multiplication of matrix How to calculate the matrix A = 24 b = - 24 AB = 0 0 -3 -6 1 -2 0 0
- 10. Another problem is, what conditions should be satisfied for multiplication of two matrices
- 11. Two discrete mathematical problems, seeking the solution of great spirit 1. Prove with reasoning rules: if the premise "all zebras have stripes" and "mark is a zebra" are true, then the conclusion "mark has stripes" is true 2. Prove that "if the earth is flat, then you can drive to the edge of the earth"; "you can't drive to the edge of the earth". Therefore, "the earth is not flat" is an effective argument
- 12. Is there any skill in elementary transformation of matrix? And how to distinguish whether a square matrix has invertible matrix?
- 13. Is the matrix the same after elementary transformation
- 14. Matrix and transformation a b 1 Given matrix A = [], if matrix A belongs to an eigenvector of eigenvalue 3, α = [], it belongs to eigenvector c d 1 one An eigenvector of value - 1 is β = [], and the matrix A is obtained -1 a b A=[c d] one α=[ 1 ] one β=[ -1 ]
- 15. How to transform the matrix into the simplest row 0 3 2 2 1 0 3 1 2 1 0 1 3 2 1 2
- 16. The matrix row transformation is changed into a row simplified ladder matrix -1 3 2 3 3 2 5 1 1 -2 -3 1
- 17. Can we use row transformation and column transformation in matrix at the same time
- 18. It is proved that R is equivalent Let R be a binary relation on N * n, arbitrary, belonging to n * n R b=d. It is proved that R is equivalent Finding quotient set n * n / R
- 19. Reflexive and anti reflexive, symmetric and antisymmetric problems in discrete mathematics! A = {1,2,3} let R1 = {,}; R2 = {} Why is R1 neither reflexive nor anti reflexive Why is R2 symmetric or antisymmetric
- 20. The proof of (P ←→ q) = (P ∨ q) ∧ (P ∨ q) in Discrete Mathematics Yes [proved by basic equivalent formula]