मराठी
तामिळनाडू बोर्ड ऑफ सेकेंडरी एज्युकेशनएचएससी विज्ञान इयत्ता ११

Using the Mathematical induction, show that for any natural number n, x2n − y2n is divisible by x + y - Mathematics

Advertisements
Advertisements

प्रश्न

Using the Mathematical induction, show that for any natural number n, x2n − y2n is divisible by x + y

बेरीज
Advertisements

उत्तर

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

shaalaa.com
Mathematical Induction
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 4: Combinatorics and Mathematical Induction - Exercise 4.4 [पृष्ठ १९६]

APPEARS IN

सामाचीर कलवी Mathematics - Volume 1 and 2 [English] Class 11 TN Board
पाठ 4 Combinatorics and Mathematical Induction
Exercise 4.4 | Q 10 | पृष्ठ १९६

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

By the principle of mathematical induction, prove the following:

13 + 23 + 33 + ….. + n3 = `("n"^2("n + 1")^2)/4` for all x ∈ N.


By the principle of mathematical induction, prove the following:

1.2 + 2.3 + 3.4 + … + n(n + 1) = `(n(n + 1)(n + 2))/3` for all n ∈ N.


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:

an – bn is divisible by a – b, for all n ∈ N.


By the principle of mathematical induction, prove the following:

52n – 1 is divisible by 24, for all n ∈ N.


By the principle of mathematical induction, prove the following:

n(n + 1) (n + 2) is divisible by 6, for all n ∈ N.


By the principle of mathematical induction, prove that, for n ≥ 1
13 + 23 + 33 + ... + n3 = `(("n"("n" + 1))/2)^2`


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 ≥ 2,
`1/(1 + 2) + 1/(1 + 2 + 3) + 1/(1 +2 + 3 + 4) + .... + 1/(1 + 2 +  3 + ... + "n") = ("n" - 1)/("n" + 1)`


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))`


Prove by Mathematical Induction that
1! + (2 × 2!) + (3 × 3!) + ... + (n × n!) = (n + 1)! − 1


By the principle of Mathematical induction, prove that, for n ≥ 1
`1^2 + 2^2 + 3^2 + ... + "n"^2 > "n"^2/3`


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


Choose the correct alternative:
In 3 fingers, the number of ways four rings can be worn is · · · · · · · · · ways


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×