Discrete Math
Please Help parts a and b
Discrete Math Please Help parts a and b Let A = {0,1}, and consider A*, the...
1. Let A= {0,1}2 U... U{0,1}5 and let < be the order on A defined by (s, t) E< if and only if s is a prefix of t. (We consider a word to be a prefix of itself.) (a) Find all minimal elements in A. (Recall that an element x is minimal if there does not exist y E A with y < x.) (b) Are 010 and 01101 comparable? 2. Give an example of a total order on...
Answer each question in the space below. 1. Let A = {0,1} U... U{0,1}5 and let be the order on A defined by (s, t) €< if and only if s is a prefix of t. (We consider a word to be a prefix of itself.) (a) Find all minimal elements in A. (Recall that an element & is minimal if there does not erist Y E A with y < x.) (b) Are 010 and 01101 comparable? 2. Give...
need help with proving discrete math HW, please try write clearly and i will give a thumb up thanks!! Let A and be B be sets and let f:A B be a function. Define C Ax A by r~y if and only if f(x)f(y). Prove thatis an equivalence relation on A. Let X be the set of~-equivalence classes of A. L.e. Define g : X->B by g(x) Prove that g is a function. Prove that g is injective. Since g...
2. (24 pts) True/False. Circle T or F. No explanation needed. (a) T F If Ris the relation whose digraph is below, then Ris reflexive. (b) T F For the relation from part (a), R is symmetric (C) T F The relation Son {a,B,y,g} whose matrix is 100.1 - 0 1 0 0 0 0 1 0 1001 is an equivalence relation. (d) T F The relation S from part (C) is a partial order. (e) T F Let the...
17-26 true or false questions 17. The smallest positive real number is c, where c = card(0,1). 18. To show that two sets A and B are equal, show that x A and x B. 19. If (vx)P(e) is false, then P(x) is never true for that domain. 20. If R is a relation on A and if (a, a) is true for some a in A, then R is reflexive. 21. If f:A → B is a function, then...
2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings Let s be a string. The length or size of a string, denoted Is, is the number of characters in s Let s be a string, and i e N such that 0 < ί < sl. We write s[i] to represent the character of s at index i, where indexing starts at 0 (so s 0] is the first character, and...
2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings. Let s be a string. The length or size of a string, denoted Is, is the number of characters in s Let s be a string, and ie N such that 0 Si< Is. We write si] to represent the character of s at index i, where indexing starts at 0 (so s(0 is the first character, and s|s -1 is the...
all parts A-E please. Problem 8.43. For sake of a contradiction, assume the interval (0,1) is countable. Then there exists a bijection f : N-> (0,1). For each n є N, its image under f is some number in (0, 1). Let f(n) :-0.aina2na3n , where ain 1s the first digit in the decimal form for the image of n, a2 is the second digit, and so on. If f (n) terminates after k digits, then our convention will be...
5. Symbolize the following argument and prove it is a valid argument. Let B ( x ) = x is a bear; D ( x ) = x is dangerous, and H ( x ) = x is hungry. Every bear that is hungry is dangerous. There is a hungry animal that is not dangerous. Therefore there is an animal that is not a bear. 6. In order to prove an quantificational argument invalid it is only necessary to find a...
QUESTION 1 Let V-L2([0,1 ],C) and > : Vx-СУч . Г f(x)g(x)dx be an inner product on V Let gor 91, 92, 93:0,1]R be given by gox)-1,g1(x)-x, 920x)-x2, g3(x) -x3 and consider the following subset S = { go, g 1, g 2, g3JC V. After applying the Gram-Schmidt process the following set of vectors T = {vo, vľ, V2, V3} is an orthonormal set, where V1, V2, V3, and V4 are given by: O vo= 1, v,-V3(2x-1), v,-V5 (6x2-6x...