离散习题(国外英文资料).docVIP

离散习题 1 sets A, B, where A = {1,2,3}, B= {1,2}, then A - B = {3} (A) - (B) = {{3}, {1,3}, {2,3},, {1,2,3}}. 2. a finite set A, |A| = n, is | (A * A) = |. 3. sets A = {a, b}, B = {1, 2}, then all mappings from A to B are 1= {(a, 1),} (B, 1)}, 2= {(a, 2),} (B, 2)}, 3= {(a, 1), (b, 2)}, 4= {(a, 2), (B, 1)}, where the double shot is 3, 4. The 4. known propositional formula G = lambda (PQ) R, G is the main disjunctive normal form (P ^ Q ^ R). 5. set G is a completely two fork tree, G has 7 points, of which 4 leaf points, then the total number of G is 12, the branch number is 3 6 A, B two sets, A= {1,2,4}, B = {3,4}, from AB = {4}, AB = {1, 2, 3, 4}; A-B = {1, 2} 7. let R be the equivalence relation on set A, and the three characteristic of R relation is reflexivity, symmetry and transitivity 8. set propositional formula G = (P (QR)), then make the formula G true explanation (1, 0, 0), (1, 0, 1), (1, 1, 0) 9. set A = {1,2,3,4}, A = {R1 relationship (1,4), (2,3), (3,2)}, {(R1 = 2,1), (3,2), (4,3)}, R1R2 ={(1,3), (2,2), (3,1)}R2R1 (2,4), (={3,3), (4,2)}R12 ={(2,2), (3,3). 10. a finite set A, B, |A| = m, |B| = n, is | | (AB) | = 2mn. 11 A, B, R is three sets, where R is the set of real numbers, A = {x | -1 = x = 1, B = xR}, {x | 0 x 2, xR}, A-B = {x | -1 x 0, xR}; B-A = {x | 1 x 2 A, xR}; B = {x | 0 = x = 1, xR}. 13. set A = {2, 3, 4, 5, 6}, R on A R in divisible set form (enumeration) denoted as {(2, 2), (2, 4), (2, 6), (3, 3), (3, 6). (4, 4), (5, 5), (6, 6). 14. first order logic formula G = xP (x) xQ (x), then G is the prefix x (P (x) V Q (x)). 15. let G be a tree with 8 vertices, then add 21 edges in G to turn G into complete graph. 16. a domain predicate is {a, b}, the expression of xR (x), xS (x) in quantifier elimination, in propositional formula and the corresponding (R (a) is a R (b)), ((a) S V S (b)). 17. sets A = {1, 2, 3, 4}, 3,2, A two, R, {(1,1), (1,2), (2,3)}, S = {(1,3), (2,3),}. Then RS = {(1, 3), (2, 2)}; R2 = {(1, 1), (1, 2), (1, 3). 1 set set A={2,