

@ prove the following inequality for all nzi, a) Suppose Hat we want to prove this...
please answer all the questions.
just rearranging. Explanation is not needed.
Use modular arithmetic to prove that 3|(221 – 1) for an integer n > 0. Hence, 3|(221 – 1) for n > 0. To show that 3|(221 – 1), we can show that (221 – 1) = 0 (mod 3). We have: (221 – 1) = (4” – 1) (mod 3) Then, (22n – 1) = (1 - 1) = 0 (mod 3) Since 4 = 1 (mod 3),...
Please answer all the four subquestions. Thank you!
2. In this problem, we will prove the following result: fG is a group of order 35, then G is isomorphic to Z3 We will proceed by contrd cuon, so throughout the ollowing questions assume hat s grou o or ㎢ 3 hat s not cyc ić. M os hese uuestions can bc le nuc endent 1. Show that every element of G except the identity has order 5 or 7. Let...
check my Q1 answer and do Q6 thanks!
plz check my answer in Q1 and do Q6 thanks!
Problems For ach peoldem other tane y will reeive a mark ef 1/s if yos do not awer. (But you esd the mon-anewer to get credit for it nly. No peoof is required for this probidem, mp sae the inly which mak the (5 points) Peove the lowing fact, which Yong'st s 1 Before starting the problems Define f R2 (0,0)R by...
a). Provide a DFA M such that L(M) = D, and provide an English
explanation of how it works (that is, what each state
represents):
b). Prove (by induction on the length of the
input string) that your DFA accepts the correct inputs (and only
the correct inputs). Hint : your explanation in part a) should
provide the precise statements that you need to show by induction.
For example, you could show by induction on |w| that
E2 = {[:],...
6. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a) How many parity bits are necessary? b) Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code, find the code word to represent the 10-bit information word: 1001100110
Please solve all parts of the question
6. (10 points 5+5) We want to prove by contradiction that, for all integers k not divisible by p, if p is prime then no two different numbers in the set Ak(k,2k, 3k.. 1)k) are congruent mod p. (a) Clearly state the assumption to begin the proof by contradiction. (b) Complete the proof by making two observations regarding this assumption that immediately lead to a contradiction
This assignment asks you to prove the following Proposition 1 Let {n} and {n} are two sequences of real numbers and L is a number such that (1.a) un → 0, and (1.b) V EN, -L Swn. We illustrate the proposition. To begin, one can check from the definition that 1/n 0. This fact, plus the arithinetic rules of convergence, generate a large family of sequences known to converge to 0. For example, 11n +7 1 11 +7 3n2 -...
Please do exercise 129:
Exercise 128: Define r:N + N by r(n) = next(next(n)). Let f:N → N be the unique function that satisfies f(0) = 2 and f(next(n)) =r(f(n)) for all n E N. 102 1. Prove that f(3) = 8. 2. Prove that 2 <f(n) for all n E N. Exercise 129: Define r and f as in Exercise 128. Assume that x + y. Define r' = {(x,y),(y,x)}. Let g:N + {x,y} be the unique function that...
Approximating With Simpson's Rule 6) Now we want to use Simpson's Rule to find the volume of the machine part. Remember that Simp- son's Rule approximates integrals, not just areas. Since we don't just want the area under the radius function, we can't just apply Simpson's Rule to the radius function. If we let f(x) be the radius of the machine part at the point x, write down the integral that gives the volume of the machine part (with an...
and Y ~ Geometric - 4 Let X ~ Geometric We assume that the random variables X and Y are statistically independent. Answer the following questions: a (3 marks) For all x E 10,1,2,...^, show that 2+1 P(X>x) P(x (3 = Similarly, for all y [0,1,2,...^, show that Show your working only for one of the two identities that are pre- sented above. Hint: You may use the following identity without proving it. For any non-negative integer (, we have:...