Advertisements
Advertisements
Question
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
Advertisements
Solution
Let P(n) be the given statement.
Now,
\[P(n): 7^{2n} + 2^{3n - 3} . 3^{n - 1} \text{ is divisible by } 25 . \]
\[\text{ Step1} : \]
\[P(1): 7^2 + 2^{3 - 3} . 3^{1 - 1} = 49 + 1 = 50 \]
\[\text{ It is divisible by 25} . \]
\[\text{ Thus, P(1) is true} \]
\[\text{ Step2: Let } P\left( m \right) \text{ be true . } \]
\[\text{ Now } , \]
\[ 7^{2m} + 2^{3m - 3} . 3^{m - 1} \text{ is divisible by} 25 . \]
\[Suppose: \]
\[ 7^{2m} + 2^{3m - 3} . 3^{m - 1} = 25\lambda . . . (1)\]
\[\text{ We have to show that } P\left( m + 1 \right) \text{ is true whenever P(m) is true} . \]
\[\text{ Now, } \]
\[P\left( m + 1 \right) = 7^{2m + 2} + 2^{3m} . 3^m \]
\[ = 7^{2m + 2} + 7^2 . 2^{3m - 3} . 3^{m - 1} - 7^2 . 2^{3m - 3} . 3^{m - 1} + 2^{3m} . 3^m \]
\[ = 7^2 \left( 7^{2m} + 2^{3m - 3} . 3^{m - 1} \right) + 2^{3m} . 3^m \left( 1 - \frac{49}{24} \right)\]
\[ = 7^2 \times 25\lambda - 2^{3m} . 3^m \times \frac{25}{2^3 . 3^1} \left[ \text{ Using } (1) \right]\]
\[ = 25\left( 49\lambda - 2^{3m - 3} . 3^{m - 1} \right) \]
\[\text{ It is divisible by } 25 . \]
\[\text{ Thus, } P\left( m + 1 \right) \text{ is true .} \]
\[\text{ By the principle of mathematical induction, P(n) is true for all n } \in N .\]
APPEARS IN
RELATED QUESTIONS
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:
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
32n+7 is divisible by 8 for all n ∈ N.
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.
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
\[\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{ 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:
3 + 7 + 11 + ..... + to n terms = n(2n+1)
Prove by method of induction, for all n ∈ N:
12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
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:
3n − 2n − 1 is divisible by 4
Answer the following:
Prove, by method of induction, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
Answer the following:
Prove, by method of induction, for all n ∈ N
12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`
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
The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.
Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.
Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
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:
For any natural number n, 7n – 2n is divisible by 5.
Prove the statement by using the Principle of Mathematical Induction:
n(n2 + 5) is divisible by 6, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
