Prove the Following by Using the Principle of Mathematical Induction for All N ∈ N: X2n – Y2n is Divisible by X + Y.

प्रश्न

Prove the following by using the principle of mathematical induction for all n ∈ N: x²ⁿ – y²ⁿ is divisible by x + y.

उत्तर

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

P(n): x²ⁿ – y²ⁿ is divisible by x + y.

It can be observed that P(n) is true for n = 1.

This is so because x²^×¹ – y²^×¹ = x² – y² = (x + y) (x – y) is divisible by (x + y).

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

x²^k – y²^k is divisible by x + y.

∴x²^k – y²^k = m (x + y), 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+ 1/((1+2)) + 1/((1+2+3)) +...+ 1/((1+2+3+...n)) = (2n)/(n +1)`

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

`a + ar + ar^2 + ... + ar^(n -1) = (a(r^n - 1))/(r -1)`

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

`(1+ 1/1)(1+ 1/2)(1+ 1/3)...(1+ 1/n) = (n + 1)`

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

`1/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`

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

Given an example of a statement P (n) such that it is true for all n ∈ N.

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.

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

1² + 3² + 5² + ... + (2n − 1)² = \[\frac{1}{3}n(4 n^2 - 1)\]

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

7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]

\[\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}\]

\[\text{ Prove that } \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ for all n } \in N .\]

\[\text{ Prove that } \frac{1}{n + 1} + \frac{1}{n + 2} + . . . + \frac{1}{2n} > \frac{13}{24}, \text{ for all natural numbers } n > 1 .\]

\[\text { A sequence } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and } x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that } x_n = \frac{2}{n!} \text{ for all } n \in N .\]

\[\text{ Using principle of mathematical induction, prove that } \sqrt{n} < \frac{1}{\sqrt{1}} + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + . . . + \frac{1}{\sqrt{n}} \text{ for all natural numbers } n \geq 2 .\]