Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that: 22n – 1 is divisible by 3.

Question

Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

2²ⁿ – 1 is divisible by 3.

Sum

Solution

Let the statement P(n) given as

P(n): 2²ⁿ – 1 is divisible by 3, for every natural number n.

We observe that P(1) is true.

Since 2² – 1 = 4 – 1 = 3

1 is divisible by 3.

Assume that P(n) is true for some natural number k.

i.e., P(k) : 2^2k – 1 is divisible by 3.

i.e., 2^2k – 1 = 3q, where q ∈ N,

Now, to prove that P(k + 1) is true,

We have P(k + 1) : `2^(2(k + 1)) - 1`

= `2^(2k + 2) – 1`

= 2^2k . 2² – 1

= 2^2k . 4 – 1

= 3.2^2k + (2^2k – 1)

= 3.2^2k + 3q

= 3(2^2k + q) = 3m, where m ∈ N,

Thus P(k + 1) is true, whenever P(k) is true.

Hence, by the Principle of Mathematical Induction P(n) is true for all natural numbers n.

shaalaa.com

Principle of Mathematical Induction

Is there an error in this question or solution?

Q 4 Q 3 Q 5

Chapter 4: Principle of Mathematical Induction - Solved Examples [Page 63]

APPEARS IN

NCERT Exemplar Mathematics Exemplar [English] Class 11

Chapter 4 Principle of Mathematical Induction
Solved Examples | Q 4 | Page 63

Video TutorialsVIEW ALL [1]

view
Video Tutorials For All Subjects
Principle of Mathematical Induction

video tutorial00:17:42

RELATED QUESTIONS

Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2) = `(n(n+1)(n+2)(n+3))/(4(n+3))`

Prove the following by using the principle of mathematical induction for all n ∈ N:

1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/3]`

Prove the following by using the principle of mathematical induction for all n ∈ N: `1/2 + 1/4 + 1/8 + ... + 1/2^n = 1 - 1/2^n`

Prove the following by using the principle of mathematical induction for all n ∈ N:

`1^2 + 3^2 + 5^2 + ... + (2n -1)^2 = (n(2n - 1) (2n + 1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 3.

Prove the following by using the principle of mathematical induction for all n ∈ N: 41ⁿ – 14ⁿ is a multiple of 27.

If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.

If P (n) is the statement "n² + n is even", and if P (r) is true, then P (r + 1) is true.

If P (n) is the statement "n² − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.

1 + 3 + 5 + ... + (2n − 1) = n² i.e., the sum of first n odd natural numbers is n².

1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]

a + ar + ar² + ... + arⁿ⁻¹ = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

5²ⁿ −1 is divisible by 24 for all n ∈ N.

2.7ⁿ + 3.5ⁿ − 5 is divisible by 24 for all n ∈ N.

\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer for all n ∈ N.

x²ⁿ⁻¹ + y²ⁿ⁻¹ is divisible by x + y for all n ∈ N.

\[\sin x + \sin 3x + . . . + \sin (2n - 1)x = \frac{\sin^2 nx}{\sin x}\]

\[\text{ Given } a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and } a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right) \text{ for } n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ Prove that } \frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1} .\]

Show by the Principle of Mathematical induction that the sum S_n of then terms of the series \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]

Prove by method of induction, for all n ∈ N:

2 + 4 + 6 + ..... + 2n = n (n+1)

Prove by method of induction, for all n ∈ N:

1² + 3² + 5² + .... + (2n − 1)² = `"n"/3 (2"n" − 1)(2"n" + 1)`

Answer the following:

Given that t_n+1 = 5t_n − 8, t₁ = 3, prove by method of induction that t_n = 5ⁿ⁻¹ + 2

Answer the following:

Prove by method of induction 15^2n–1 + 1 is divisible by 16, for all n ∈ N.

Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.