MAT1830 : PRACTICE QUESTIONS ON INDUCTION 1. Prove using induction that ∑đ=đ đ=3 (2đ) = (n + 3)(n - 2) for all integers n > 3. 2. Prove by induction that 1 ī 2 2 īĢ 2 ī 32 īĢ 3 ī 4 2 īĢ ... to n terms is given by 1 n ī¨n īĢ 1īŠī¨n īĢ 2 īŠī¨3n īĢ 5īŠ 12 3. 4. 4 n ī2 īĢ 17 n īĢ 22 is divisible by 16 for every positive integer n. Prove by induction 3 n Prove that, if the statement n! īž 2n īĢ 2 is true for n = k, where k is a positive integer, then it is true for n = k + 1. Hence, find the set of values of n for which the statement is true. 5. The sequence of real numbers u1 , u2 , u3 ,... is such that u1 īŊ 1 and u n īĢ1 īŊ 5u n īĢ 4 for all n īŗ 1 . un īĢ 2 Prove by induction that un īŧ 4 for all n īŗ 1 . 6. Let r0, r1, r2, …. be a recursive sequence defined by r0 = 3; r1 = 2 and đđ = (18n)đđ−1 + (12)đđ−2 for all integers n ≥ 2. Prove using strong induction that 2đ divides đđ for all integers n ≥ 0. 7. If the sequence đĸ1 ,đĸ2 ,đĸ3 , ….. is defined by đĸ1 = 1, đĸ2 = 2 and đĸđ+2 + 4đĸđ = 4đĸđ+1 , Prove by induction that đĸđ = 2đ−1 8. Prove by induction that the number of steps to complete the disk movements in the tower ofHanoi problem is ( 2đ – 1) for a system of n disks, for all n≥1