Advertisements
Advertisements
Question
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
Advertisements
Solution
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
RELATED QUESTIONS
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/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:
`(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:
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 "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
52n −1 is divisible by 24 for all n ∈ N.
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] N .
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ N?
x2n−1 + y2n−1 is divisible by x + y 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 } }\]
\[\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:
12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`
Prove by method of induction, for all n ∈ N:
3n − 2n − 1 is divisible by 4
Prove by method of induction, for all n ∈ N:
Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1
Answer the following:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
1 + 3 + 5 + ... + (2n – 1) = n2
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.
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 by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by
Sn = `{{:((n(n + 1)^2)/2",", "if n is even"),((n^2(n + 1))/2",", "if n is odd"):}`
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:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
