Advertisements
Advertisements
प्रश्न
By the principle of mathematical induction, prove that, for n ≥ 1
12 + 32 + 52 + ... + (2n − 1)2 = `("n"(2"n" - 1)(2"n" + 1))/3`
उत्तर
Let P(n) = 12 + 32 + 52 + ... + (2n − 1)2 = `("n"(2"n" - 1)(2"n" + 1))/3`
For n = 1
P(1) = (2 × 1 − 1)2
= `(1(2 xx 1 - 1)(2 xx 1 + 1))/3`
⇒ 1 = `(1 xx 1 xx 3)/3`
∴ P(1) is true
Let P(n) be true for n = k
∴ P(k) = 12 + 32 + 52 + ... + (2k − 1)2 = `("n"(2"k" - 1)(2"k" + 1))/3` ......(i)
For n = k + 1
R.H.S = `(("k" + 1)(2"k" + 1)(2"k" + 3))/3`
L.H.S = `("k"(2"k" - 1)(2"k" + 1))/3 ("k" + 1)^2` .....(Using (i)]
= `(2"k" + 1) [("k"(2"k" - 1))/3 + (2"k" + 1)]`
= `(2"k" + 1) [(2"k"^2- "k" + 6"k" + 3)/3]`
=`((2"k" - 1)(2"k"^2 + 5"k" + 3))/3`
= `(("k" + 1)("k" + 1)(2"k" + 3))/3`
= `(("k" + 1)(2"k" + 1)(2"k" + 3))/3`
∴ P(k + 1) is true
Thus P(k) is true
⇒ P(k + 1) is true.
Hence by principle of mathematical induction,
P(k) is true for all n ∈ N.
APPEARS IN
संबंधित प्रश्न
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:
1 + 4 + 7 + ……. + (3n – 2) = `("n"(3"n" - 1))/2` 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`
By the principle of Mathematical induction, prove that, for n ≥ 1
1.2 + 2.3 + 3.4 + ... + n.(n + 1) = `("n"("n" + 1)("n" + 2))/3`
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)`
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 n3 − 7n + 3, is divisible by 3, for all natural numbers n
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
