Advertisements
Advertisements
प्रश्न
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
Advertisements
उत्तर
Given expression
2.7n + 3.5n - 5
Proof – Let, P(n) = 2.7n + 3.5n - 5 is divisible by 24.
We note that P (n) is true when n = 1,
Since P (1) = 14 + 15 – 5 = 24 which is divisible by 24.
Assume that it is true for P (k).
i.e. P(k) = 2.7k + 3.5k - 5 = 24q ......(1) when q ∈ N
Now according to the mathematical induction principle, we have to prove it is also true for P (k + 1) whenever p (k) is true.
Now substitute in place of k, (k + 1) we have,
⇒ P(k + 1) = 2.7k+1 + 3.5k+1 - 5
⇒ 2.7.7k + 3.5.5k - 5
Now add and subtract by 3.7.5k - 7.5 we have,
⇒ 2.7.7k + 3.5.5k - 5 + 3.7.5k - 7.5 - (3.7.5k - 7.5)
⇒ 7(2.7k + 3.5k - 5) + 3.5.5k - 5 - (3.7.5k - 7.5)
Now from equation (1) we have,
⇒ 7(24q) + 3.5.5k - 5 - 3.7.5k + 7.5
⇒ 7(24q) - 2.3.5k - 5 + 35
⇒ 7(24q) - 2.3.5k + 30
⇒ 7(24q) - 6(5k - 5)
Now as we know that (5k - 5) is a multiple of 4 so in place of that we can write (4p) where (p) belongs to the natural number.
⇒ 7(24q) - 6(4p)
⇒ 24(7q - p)
So as we see this is a multiple of 24.
Thus P (k + 1) is true whenever P (k) is true.
So according to the principle of mathematical induction 2.7k + 3.5k - 5 is divisible by 24.
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/3]`
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
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 "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
Given an example of a statement P (n) such that it is true for all n ∈ N.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
32n+7 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
Show by the Principle of Mathematical induction that the sum Sn of then terms of the series \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]
Prove that the number of subsets of a set containing n distinct elements is 2n, 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 .\]
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:
(24n−1) is divisible by 15
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
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
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.
Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`
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
Give an example of a statement P(n) which is true for all n. Justify your answer.
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:
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.
Prove the statement by using the Principle of Mathematical Induction:
`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers n ≥ 2.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
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.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
