Imprecise Counting - Long Runs in Binary Strings
Let n=2^k for some positive integer k and consider the set Sn of all n-bit binary strings.
(n−k−c+1)∑(j=1) {|Xj|≤2^n / 2^c}
(Hint: Remember that 2^k=n.)so,
which must be the same as and from it follows,
.
Since
we obtain the given inequality
.
Imprecise Counting - Long Runs in Binary Strings Let n=2^k for some positive integer k and...
Problem 3 (Counting binary strings) 20 marks/ Consider all bit strings of length 15. 1. How many begin with 00? 2. How many begin with 00 and end with 11? 3. How many begin with 00 or end with 10? 4. How many have exactly ten 1's? 5. How many have exactly ten 1's such as none of these 1's are adjacent to each other? Provide detailed justifications for your answers. Problem 3 (Counting binary strings) 20 marks/ Consider all...
Q18 12 Points For any positive integer n, let bn denote the number of n-digit positive integers whose digits are all 1 or 2, and have no two consecutive digits of 1. For example, for n - 3, 121 is one such integer, but 211 is not, since it has two consecutive 1 's at the end. Find a recursive formula for the sequence {bn}. You have to fully prove your answer.
PROJECT 2-COUNTING SUBSETS (BINARY STRINGS Choose 6 letters of the English alphabet including all the different characters in your family name (If you have more than & diffecent characters, choose the first 61. Let X be the set di all lower case vensions of the letters you have chosen. Let S be the set of all binary strings of length 6 (0 Using cofrect set notation, list the elements in set X. (u) ust all the subsets of X with...
Ok = (6) Let n be a positive integer. For every integer k, define the 2 x 2 matrix cos(27k/n) - sin(2nk/n) sin(2tk/n) cos(27 k/n) (a) Prove that go = I, that ok + oe for 0 < k < l< n - 1, and that Ok = Okun for all integers k. (b) Let o = 01. Prove that ok ok for all integers k. (c) Prove that {1,0,0%,...,ON-1} is a finite abelian group of order n.
=(V, En) 5. Let n1 be an integer and define the graph Gn as follows {0,1}", the set of all binary strings of length n. Vn = Two vertices x and y are connected by an edge emu if and only if x and y differs in exactly one position. (a) (4 points) Draw the graph Gn for n = 1,2,3 (b) (4 points) For a general n 2 1, find |Vn and |En (c) (10 points) Prove that for...
Exercise 9. Let n 2 2 be a positive integer. Let a -(ri,...,^n) ER". For any a,y E R" sphere of radius 1 centered at the origin. Let x E Sn-be fixed. Let v be a random vector that is uniformly distributed in S"1. Prove: 10Vn
Problem 3 Let n and k > l be positive integers. How many different integer solutions are there to x1 +...+ In = k, with all xi <l?
Let S(n) be a statement parameterized by a positive integer n. Consider a proof that uses strong induction to prove that for all n 4.S(n) is true. The base case proves that S(4), S(5), S(6), S(7), and S(8) are all true. Select the correct expressions to complete the statement of what is assumed and proven in the inductive step. Supposed that for k> (1?),s() is true for everyj in the range 4 through k. Then we will show that (22)...
QUESTION C. (a) Let k be a field and let n be a positive integer. Define what is meant by a monomial ideal in k[x,...,zn]. 2. (b) State what it means for a ring R to be Noetherian. (c) State Hilbert's basis theorem. Give a proof of Hilbert's basis theorem using the fact if k is a field the polynomial ring kli,..., In] is Noetherian. 1S (a) Let k be a field and let n be a positive integer. Define...
Prove: Let k be a positive integer, and set n :=2k-1(2k – 1). Then (2k+1 – 1)2 = 8n +1 Prove: Let n be a positive integer, and let s and t be integers. Show that Hire (st) = n(s) in (t) mod n.