Advertisements
Advertisements
Question
Using the Mathematical induction, show that for any natural number n, x2n − y2n is divisible by x + y
Advertisements
Solution
Let P(n) = x2n – y2n is divisible by (x + y)
For n = 1
P(1) = x2 × 1 – y2 × 1 is divisible by (x + y)
⇒ (x + y) (x – y) is divisible by (x + y)
∴ P(1) is true
Let P(n) be true for n = k
∴ P(k) = x2k – y2k is divisible by (x + y)
⇒ x2k – y2k = λ(x + y) ......(i)
For n = k + 1
⇒ P(k + 1) = `x^(2("k" + 1)) – y^(2("k" + 1))` is divisible by (x + y)
Now `x^(2("k" + 2)) – y^(2("k" + 2))`
= `x^(2"k" + 2) – x^(2k)y^2 + x^(2k)y^2 – y^(2k) + 2`
= `x^(2k)*x^2 – x^(2k)y^2 + x^(2k)y^2 – y^(2k)y^2`
= `x^(2k) (x^2 – y^2) + y^2λ (x + y)` ......[Using (i)]
⇒ `x^(2"k" + 2) – y^(2"k" + 2)` is divisible by (x + y)
∴ P(k + 1) is true.
Thus P(k) is true
⇒ P(k + 1) is true.
Hence by principle of mathematical induction,
P(n) is true for all n ∈ N
APPEARS IN
RELATED QUESTIONS
By the principle of mathematical induction, prove the following:
4 + 8 + 12 + ……. + 4n = 2n(n + 1), for all n ∈ N.
By the principle of mathematical induction, prove the following:
1 + 4 + 7 + ……. + (3n – 2) = `("n"(3"n" - 1))/2` for all n ∈ N.
By the principle of mathematical induction, prove the following:
32n – 1 is divisible by 8, for all n ∈ N.
By the principle of mathematical induction, prove the following:
an – bn is divisible by a – b, for all n ∈ N.
By the principle of mathematical induction, prove the following:
2n > n, for all n ∈ N.
The term containing x3 in the expansion of (x – 2y)7 is:
Prove that the sum of the first n non-zero even numbers is n2 + n
Using the Mathematical induction, show that for any natural number n ≥ 2,
`(1 - 1/2^2)(1 - 1/3^2)(1 - 1/4^2) ... (1 - 1/"n"^2) = ("n" + 1)/2`
Using the Mathematical induction, show that for any natural number n,
`1/(1*2*3) + 1/(2*3*4) + 1/(3*4*5) + ... + 1/("n"("n" + 1)*("n" + 2)) = ("n"("n" + 3))/(4("n" + 1)("n" + 2))`
Using the Mathematical induction, show that for any natural number n,
`1/(2.5) + 1/(5.8) + 1/(8.11) + ... + 1/((3"n" - 1)(3"n" + 2)) = "n"/(6"n" + 4)`
Prove by Mathematical Induction that
1! + (2 × 2!) + (3 × 3!) + ... + (n × n!) = (n + 1)! − 1
Use induction to prove that 5n+1 + 4 × 6n when divided by 20 leaves a remainder 9, for all natural numbers n
Use induction to prove that 10n + 3 × 4n+2 + 5, is divisible by 9, for all natural numbers n
Prove that using the Mathematical induction
`sin(alpha) + sin (alpha + pi/6) + sin(alpha + (2pi)/6) + ... + sin(alpha + (("n" - 1)pi)/6) = (sin(alpha + (("n" - 1)pi)/12) xx sin(("n"pi)/12))/(sin (pi/12)`
Choose the correct alternative:
In 3 fingers, the number of ways four rings can be worn is · · · · · · · · · ways
Choose the correct alternative:
Everybody in a room shakes hands with everybody else. The total number of shake hands is 66. The number of persons in the room is ______
