Advertisements
Advertisements
प्रश्न
32n+7 is divisible by 8 for all n ∈ N.
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n): 5^{2n} - 1 \text{ is divisible by 24 for all n} \in N . \]
\[\text{ Step } 1: \]
\[P(1) = 5^2 - 1 = 25 - 1 = 24 \]
\[\text{ It is divisible by } 24 . \]
\[\text{ Thus, P(1) is true } . \]
\[\text{ Step} 2: \]
\[\text{ Let P(m) be true .} \]
\[\text{ Then, 5^{2m} - 1 is divisible by 24 .} \]
\[\text{ Now, let} 5^{2m} - 1 = 24\lambda, \text{ where } \lambda \in N . \]
\[\text{ We need to show that P(m + 1) is true whenever P(m) is true } . \]
\[\text{ Now,} \]
\[P(m + 1) = 5^{2m + 2} - 1\]
\[ = 5^{2m} 5^2 - 1\]
\[ = 25(24\lambda + 1) - 1\]
\[ = 600\lambda + 24\]
\[ = 24(25\lambda + 1)\]
\[\text{ It is divisible by 24 } . \]
\[\text{ Thus, P(m + 1) is true } . \]
\[\text{ By the principle of mathematical induction, P(n) is true for all n } \in 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:
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+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 1)^2`
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))`
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] N .
\[\text{ A sequence } a_1 , a_2 , a_3 , . . . \text{ is defined by letting } a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \text{ for all } n \in N .\]
\[\text { A sequence } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and } x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that } x_n = \frac{2}{n!} \text{ for all } n \in N .\]
\[\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 .} \]
\[\text{ The distributive law from algebra states that for all real numbers} c, a_1 \text{ and } a_2 , \text{ we have } c\left( a_1 + a_2 \right) = c a_1 + c a_2 . \]
\[\text{ Use this law and mathematical induction to prove that, for all natural numbers, } n \geq 2, if c, a_1 , a_2 , . . . , a_n \text{ are any real numbers, then } \]
\[c\left( a_1 + a_2 + . . . + a_n \right) = c a_1 + c a_2 + . . . + c a_n\]
Prove by method of induction, for all n ∈ N:
2 + 4 + 6 + ..... + 2n = n (n+1)
Prove by method of induction, for all n ∈ N:
`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`
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))`
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
Answer the following:
Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
A student was asked to prove a statement P(n) by induction. He proved that P(k + 1) is true whenever P(k) is true for all k > 5 ∈ N and also that P(5) is true. On the basis of this he could conclude that P(n) is true ______.
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
Prove the statement by using the Principle of Mathematical Induction:
32n – 1 is divisible by 8, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.
Prove the statement by using the Principle of Mathematical Induction:
2n < (n + 2)! for all natural number n.
A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
State whether the following statement is true or false. Justify.
Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.
