Advertisements
Advertisements
प्रश्न
By the principle of Mathematical induction, prove that, for n ≥ 1
`1^2 + 2^2 + 3^2 + ... + "n"^2 > "n"^2/3`
Advertisements
उत्तर
Let P(n) is the statement `1^2 + 2^2 + 3^2 + ... + "n"^2 > "n"^2/3`
To prove P(1) is true
P(1) = 12
= `1> 1^3/3 (= 1/3)`
`1 > 1/3` which is true
So P(1) is true
Assume that the given statement is true for n = k
(i.e.) `1^2 + 2^2 + ... + "k"^2 > "k"^3/3` is true
To prove P(k + 1) is true
P(k + 1) = P(k) + (k + 1)
P(k + 1) = `1^2 + 2^2 + ... + "k"^2 + ("k" + 1)^2 > "k"^2/3 + ("k" + 1)^2`
R.H.S = `("k"^3 + 3("k" + 1)^2)/3`
= `("k"^3 + 3("k"^2 + 2"k" + 1))/3`
= `("k"^3 + 3"k"^2 + 6"k" + 3)/3`
= `("k"^3 + 3"k"^2 + 3"k" + 3"k" + 1 + 2)/3`
= `("k"^3 + 3"k"^2 + 6"k" + 3)/3 + (3"k" + 2)/3`
= `("k" + 1)^3/3 + (3"k" + 2)/3 > ("k" + 1)^3/3`
⇒ P(k + 1) = `1^2 + 2^2 + ... + ("k" + 1)^2 > ("k" + 1)^2/3`
⇒ P(k + 1) is true whenever P(k) is true.
So by the principle of mathematical inductions
P(n) is true.
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 + 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:
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 the following:
2n > n, for all n ∈ N.
The term containing x3 in the expansion of (x – 2y)7 is:
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`
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^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))`
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
Choose the correct alternative:
In 3 fingers, the number of ways four rings can be worn is · · · · · · · · · ways
Choose the correct alternative:
If `""^("a"^2 - "a")"C"_2 = ""^("a"^2 - "a")"C"_4` then the value of a is
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 ______
