Advertisements
Advertisements
Question
Advertisements
Solution
Let P(n) be the given statement.
Now,
\[P(n): \frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n \text{ is a positive integer for all } n \in N . \]
\[\text{ Step } 1: \]
\[P(1) = \frac{1}{11} + \frac{1}{5} + \frac{1}{3} + \frac{62}{165} = \frac{15 + 33 + 55 + 62}{165} = \frac{165}{165} = 1 \]
\[\text{ It is certainly a positive integer } . \]
\[\text{ Hence, P(1) is true .} \]
\[\text{ Step2: } \]
\[\text{ Let P(m) be true .} \]
\[\text{ Then, } \frac{m^{11}}{11} + \frac{m^5}{5} + \frac{m^3}{3} + \frac{62}{165}m \text{ is a positive integer . } \]
\[\text{ Now, let } \frac{m^{11}}{11} + \frac{m^5}{5} + \frac{m^3}{3} + \frac{62}{165}m = \lambda, \text{ where } \lambda \in N\text{ is a positive integer . } \]
\[\text{ We have to show that P(m + 1) is true whenever P(m) is true } . \]
\[\text{ To prove: } \frac{(m + 1 )^{11}}{11} + \frac{(m + 1 )^5}{5} + \frac{(m + 1 )^3}{3} + \frac{62}{165}(m + 1)\text{ is a positive integer .} \]
\[\text{ Now, } \]
\[\frac{(m + 1 )^{11}}{11} + \frac{(m + 1 )^5}{5} + \frac{(m + 1 )^3}{3} + \frac{62}{165}(m + 1)\]
\[ = \frac{1}{11}\left( m^{11} + 11 m^{10} + 55 m^9 + 165 m^8 + 330 m^7 + 462 m^6 + 462 m^5 + 330 m^4 + 165 m^3 + 55 m^2 + 11m + 1 \right)\]
\[ + \frac{1}{5}\left( m^5 + 5 m^4 + 10 m^3 + 10 m^2 + 5m + 1 \right) + \frac{1}{3}\left( m^3 + 3 m^2 + 3m + 1 \right)\]
\[ + \frac{62}{165}m + \frac{62}{165}\]
\[ = \left[ \frac{m^{11}}{11} + \frac{m^5}{5} + \frac{m^3}{3} + \frac{62}{165}m \right] + m^{10} + 5 m^9 + 15 m^8 + 30 m^7 + 42 m^6 + 42 m^5 + 31 m^4 + 17 m^3 + 8 m^2 + 3m + \frac{1}{11} + \frac{1}{5} + \frac{1}{3} + \frac{6}{105}\]
\[ = \lambda + m^{10} + 5 m^9 + 15 m^8 + 30 m^7 + 42 m^6 + 42 m^5 + 31 m^4 + 17 m^3 + 8 m^2 + 3m + 1\]
\[\text{ It is a positive integer } . \]
\[\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
RELATED QUESTIONS
Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
Prove the following by using the principle of mathematical induction for all n ∈ N (2n +7) < (n + 3)2
Given an example of a statement P (n) such that it is true for all n ∈ N.
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.
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}\] .
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
(ab)n = anbn for all n ∈ 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.
\[\text{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{ is true for all n } \in 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:
Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1
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
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`
State whether the following proof (by mathematical induction) is true or false for the statement.
P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`
Proof By the Principle of Mathematical induction, P(n) is true for n = 1,
12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that
(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`
Prove the statement by using the Principle of Mathematical Induction:
23n – 1 is divisible by 7, for all natural numbers n.
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, 7n – 2n is divisible by 5.
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:
n3 – n is divisible by 6, for each natural number n ≥ 2.
Prove the statement by using the Principle of Mathematical Induction:
n(n2 + 5) is divisible by 6, for each natural number n.
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 for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
