#Stay_Ahead of your Class
Listen NCERT Audio Books to boost your productivity and retention power by 2X.
Using the principle of mathematical induction, prove each of the following for all n ϵ N:
1 + 2 + 3 + 4 + … + n = 1/2 n(n + 1)
2 + 4 + 6 + 8 + …. + 2n = n(n + 1)
2 + 6 + 18 + … + 2 × 3n–1 = (3n –1)
12 + 32 + 52 + 72 + … + (2n – 1)2 =
1.2 + 2.22 + 3.23 + …. + n.2n =(n – 1)2n+1 + 2.
3.22 + 32.23 + 33.24 + …. + 3n.2n+1 = (6n – 1).
.
= (n + 1)2.
= (n + 1).
n × ( n + 1 ) × ( n + 2 ) is multiple of 6
(x2n – y2n) is divisible by (x + y).
(x2n – 1) - 1 is divisible by (x – y), where x ≠ 1.
{(41)n – (14)n} is divisible by 27.
(4n + 15n – 1) is divisible by 9.
(32n+2 – 8n – 9) is divisible by 8.
(23n – 1) is a multiple of 7
3n≥ 2n.