Prove the Following by Using the Principle of Mathematical Induction for All N ∈ N: 32n + 2 – 8n – 9 is Divisible by 8.

प्रश्न

Prove the following by using the principle of mathematical induction for all n ∈ N: 3²ⁿ^{+ 2} – 8n– 9 is divisible by 8.

उत्तर

Let the given statement be P(n), i.e.,

P(n): 3²ⁿ^{+ 2} – 8n – 9 is divisible by 8.

It can be observed that P(n) is true for n = 1 since 3²^×^{1 + 2} – 8 × 1 – 9 = 64, which is divisible by 8.

Let P(k) be true for some positive integer k, i.e.,

3²^k^{+ 2} – 8k – 9 is divisible by 8.

∴3²^k^{+ 2} – 8k – 9 = 8m; where m ∈ N … (1)

We shall now prove that P(k + 1) is true whenever P(k) is true.

Consider

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

Hence, by the principle of mathematical induction, statement P(n) is true for all natural numbers i.e., n.

shaalaa.com

Principle of Mathematical Induction

या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

view
व्हिडिओ ट्यूटोरियल For All Subjects
Principle of Mathematical Induction

video tutorial00:17:42

संबंधित प्रश्‍न

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

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

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.3 + 3.5 + 5.7 + ...+(2n -1)(2n + 1) = `(n(4n^2 + 6n -1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N: 10²ⁿ^{– 1}+ 1 is divisible by 11

Prove the following by using the principle of mathematical induction for all n ∈ N (2n +7) < (n + 3)²

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.

\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]

\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]

1.2 + 2.2² + 3.2³ + ... + n.2ⁿ= (n − 1) 2ⁿ⁺¹+2

2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]

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

3²ⁿ+7 is divisible by 8 for all n ∈ N.

3²ⁿ⁺² −8n − 9 is divisible by 8 for all n ∈ N.

7²ⁿ + 2³ⁿ⁻³. 3ⁿ⁻¹ is divisible by 25 for all n ∈ N.

Prove that n³ - 7n + 3 is divisible by 3 for all n \[\in\] N .

\[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ N and \[0 < x < \frac{\pi}{2}\]

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

\[\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 that the number of subsets of a set containing n distinct elements is 2ⁿ, for all n \[\in\] N .

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

5 + 5² + 5³ + .... + 5ⁿ = `5/4(5^"n" - 1)`

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

(cos θ + i sin θ)ⁿ = cos (nθ) + i sin (nθ)

Answer the following:

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

`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`

Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`

The distributive law from algebra says that for all real numbers c, a₁ and a₂, we have c(a₁ + a₂) = ca₁ + ca₂.

Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a₁, a₂, ..., a_n are any real numbers, then c(a₁ + a₂ + ... + a_n) = ca₁ + ca₂ + ... + ca_n.