Advertisements
Advertisements
प्रश्न
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.
Advertisements
उत्तर
P(n) = xn – yn is divisible by x – y, x integers with x ≠ y.
So, substituting different values for n, we get,
P(0) = x0 – y0 = 0 Which is divisible by x − y.
P(1) = x − y Which is divisible by x − y.
P(2) = x2 – y2
= (x + y)(x − y) Which is divisible by x − y.
P(3) = x3 – y3
= (x − y)(x2 + xy + y2) Which is divisible by x − y.
Let P(k) = xk – yk be divisible by x – y;
So, we get,
⇒ xk – yk = a(x − y).
Now, we also get that,
⇒ P(k + 1) = xk+1 – yk+1
= xk(x − y) + y(xk − yk)
= xk(x − y) + ya(x − y) Which is divisible by x − y.
⇒ P(k + 1) is true when P(k) is true.
Therefore, by Mathematical Induction,
P(n) xn – yn is divisible by x – y, where x integers with x ≠ y which is true for any natural number n.
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer.
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
32n+7 is divisible by 8 for all n ∈ N.
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ N?
x2n−1 + y2n−1 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 Sn 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 2n, for all n \[\in\] N .
Prove by method of induction, for all n ∈ N:
3 + 7 + 11 + ..... + to n terms = n(2n+1)
Prove by method of induction, for all n ∈ N:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
Prove by method of induction, for all n ∈ N:
`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Prove by method of induction, for all n ∈ N:
Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
Answer the following:
Prove, by method of induction, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
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:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
Give an example of a statement P(n) which is true for all n. Justify your answer.
Prove the statement by using the Principle of Mathematical Induction:
n3 – 7n + 3 is divisible by 3, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
n3 – n is divisible by 6, for each natural number n ≥ 2.
Prove the statement by using the Principle of Mathematical Induction:
`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers n ≥ 2.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
