Advertisements
Advertisements
प्रश्न
Prove the statement by using the Principle of Mathematical Induction:
n3 – n is divisible by 6, for each natural number n ≥ 2.
Advertisements
उत्तर
P(n) = n3 – n is divisible by 6.
So, substituting different values for n, we get,
P(0) = 03 – 0 = 0 Which is divisible by 6.
P(1) = 13 – 1 = 0 Which is divisible by 6.
P(2) = 23 – 2 = 6 Which is divisible by 6.
P(3) = 33 – 3 = 24 Which is divisible by 6.
Let P(k) = k3 – k be divisible by 6.
So, we get,
⇒ k3 – k = 6x
Now, we also get that,
⇒ P(k + 1) = (k + 1)3 – (k + 1)
= (k + 1)(k2+ 2k + 1 − 1)
= k3 + 3k2 + 2k
= 6x + 3k(k + 1) ......[n(n + 1) is always even and divisible by 2]
= 6x + 3 × (2y) Which is divisible by 6, where y = k(k + 1)
⇒ P(k + 1) is true when P(k) is true.
Therefore, by Mathematical Induction,
P(n) = n3 – n is divisible by 6, for each 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: `1/2 + 1/4 + 1/8 + ... + 1/2^n = 1 - 1/2^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:
`(1+ 1/1)(1+ 1/2)(1+ 1/3)...(1+ 1/n) = (n + 1)`
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`
Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 3.
Prove the following by using the principle of mathematical induction for all n ∈ N (2n +7) < (n + 3)2
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
Given an example of a statement P (n) such that it is true for all n ∈ N.
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 + 2 + 3 + ... + n = \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
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)\] for n ≥ 2, where a > 0, A > 0.
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}\]
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] 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} .\]
\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{ for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n } \in N \text{ using mathematical induction .} \]
Prove by method of induction, for all n ∈ N:
`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`
Answer the following:
Prove by method of induction loga xn = n logax, x > 0, n ∈ N
Answer the following:
Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N
Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.
Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.
Prove the statement by using the Principle of Mathematical Induction:
4n – 1 is divisible by 3, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
n3 – 7n + 3 is divisible by 3, for all natural numbers n.
A sequence a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.
A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
