Kjhghikgkyb

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Assignment 6 (Mathematical Induction)

Prove by Principle of Mathematical Induction (1 to 9):

n( n  1)( n  2)
1. 1.2  2.3  3.4  ...  n( n  1) 
3

n2 ( n  1) 2
2. 13  23  33  ...  n3 
4

3. ( a n  1)  ( a  1).( an 1  a n  2  an  3  ...  a  1)
1 1 1 1 1
4. 2
 2  2  ...  2  2 
1 2 3 n n
1 2 3 n n2
5.    ...  n  2  n
2 22 23 2 2

 2n !
6. 2.6.10.14...(4 n  2) 
n!
7. 1.1!  2.2!  3.3!  ...n.n!  ( n  1)!  1

8. n!  n2 for every n  4

9. n!  n3 for every n  6
10. Suppose that the number an are defined inductively by a1  1, a2  2, a3  3 and an  an -1  an-2  an -3 for all n  4 . Use the second

principle of finite induction to show that an  2n for every positive integer n.

11. If the number an are defined by a1  11, a2  21and an  3.an-1  2.an-2 for all n  3 . Prove that an  5.2n  1 for every positive
integer n.

www.atharvlabs.com Page 1

You might also like