(15 minutes)An infinite ternary string is a string 0,0203 ..., where a; € {0, 1, 2}....
Problem 3. A ternary string is a sequence of O's, 1's and 2's. Just like a bit string, but with three symbols 0,1 and 2. Let's call a ternary string good provided it never contains a 2 followed immediately by a 0, i.e., does not contain the substring 20. Let Go be the number of good strings of length n. For example, G_1=3, and G. = 8 (since of the 9 ternary strings of length 2, only one is not...
Prove that a disjoint union of any finite set and any countably infinite set is countably infinite. Proof: Suppose A is any finite set, B is any countably infinite set, and A and B are disjoint. By definition of disjoint, A ∩ B = ∅ Then h is one-to-one because f and g are one-to one and A ∩ B = 0. Further, h is onto because f and g are onto and given any element x in A ∪...
Discrete mathematics
2) Let be eumber of ternary strings (of 0s, 1s and 2s) of length n that have no adjacent even digits. For example, so (the empty string), s3 (the strings 0, 1 and 2), while s2 5: 01, 0, 12, 2 because the strings 00,02, 20, 22 are not allowed, as they have adjacent even digits. As another example, the string 10112 is allowed, while the strings 10012 and 120121 are not allowed (a) Find #3; (b) find...
Q3 Let A = {a,b,c} and Aº = {abcw1W2 ---W | W; E A for all i > 1} denote the set of all infinite length strings over A that start with the “abc" substring. That is, each string A™ is an infinite sequence of characters "abcw1W2 ... Wo" where each wie A. Prove that Aº is not countable using a proof by contradiction that includes a diagonalization argument.
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...
Question 7 Classify each of the following sets as finite, countable infinite, or uncountable (no proof is necessary): A=0 B = {2 ER: 0 < x < 0.0001} C=0 D=N E = {R} F= {n EN:n <9000} G=Z/5Z H = P(N) I= {n €Z:n > 50 J=Z Bonus: Give an example of a set with larger cardinality then any of the above sets.
b and c please explian thx
i
post the question from the book
Let 2 be a non-empty set. Let Fo be the collection of all subsets such that either A or AC is finite. (a) Show that Fo is a field. Define for E e Fo the set function P by ¡f E is finite, 0, if E is finite 1, if Ec is finite. P(h-10, (b) If is countably infinite, show P is finitely additive but not-additive. (c)...
row reduction in uncountable dimension.
Part 2. (Row-reduction in countably-infinite dimension) Let V denote the vector space of polynomials (of all degrees). Recall that V is an infinite-dimensional vector space, but it has a countable basis. Consider Te Hom(V, V) defined as T(p())5p () 10p(x - 1) 2.1. Write T as an oo x oo matrix, in the standard basis 1,X, x2, 13,... of V 2.2. Write T as an oo x oo matrix, in the basis 1, + 1,...
Exercise 5.14. Just like binary, ternary and decimal erpansions, all points a E [0,1 have a fifth order expansion described as follows: associate with z є 0,1] a string .s1s2 of digits where si є {0, 1, 2, 3, 4), and satisfy z Σ si that contains no 2's. how does this set differ from the set constructed in the previous erercise? What is its Suppose we construct the set of points x є 10,11 uho have a fifth order...
2. A binary string s a finite sequence u = ala2 . . . an, where each ai įs either 0 or 1. In this case n is the length of the string v. The strings ai,aia2,...,ai...an-1,aan are all prefixes of v. On the set X of all binary strings consider the relations Ri and R2 defined as follows R, = {(u, u) | w and u have the same length } {(w, u) | w is a prefix of...