![Now 197-19 = 12x+2 iy-ll - 128-1 +2iy) √ 122-12+ (24² 2f4x2 - 4x +1+422 254624%) -40+1 = 5haudes [:-17121] 12-21 ixtiy-2/2 •](http://img.homeworklib.com/questions/26d149b0-240a-11eb-a144-0994384d914c.png?x-oss-process=image/resize,w_560)
Use the Principle of Mathematical Induction to prove that (2i+3) = n(n + 4) for all n > 1.
Problem 30. Prove that N, Z, Q and R are infinite sets. (HINT: Prove by induction on n that is f: NN then (3k N(Vj Nn)k> f(j). Then conclude that f cannot possibly be onto N. A similar strategy works for Z, gq and R as well.)
Prove that is an integer for all n > 0.
For all n E N prove that 0 <e- > < 2 k!“ (n + 1)! k=0 Hint: Think about Taylor approximations of the function e".
8. Use mathematical induction to prove that F4? = FmFn+1 Yn> 1, where Fn is the n-th Fibonacci number. k=1
5. Prove that U(2") (n > 3) is not cyclic.
i. (2nd Principle of Induction): Suppose that a1 = 2 and a2 = 4 and for n > 2, an = 5an-1 – 6an-2. Prove that for all n e N, an = 2". (This is easy. Show precisely where you need the 2nd Principle.)
3. Use the mean value theorem to prove the following inequality. (1 +x)" >1 for z >0 andnEN
(2) Prove by induction that for all integers n > 2. Hint: 2n-1-2n2,
Q 3 a) Let n > 2 be an integer. Prove that the set {z ET:z” = 1} is a subgroup of (T, *). Show that it is isomorphic to (Zn, + mod n). b) Show that Z2 x Z2 is not isomorphic to Z4. c) Show that Z2 x Z3 is isomorphic to 26.