Uploaded by oqihen003

MAT1830 INDUCTION PRACTICE QUESTIONS (1)

advertisement
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
Download