Advertisements
Advertisements
प्रश्न
Advertisements
उत्तर
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
संबंधित प्रश्न
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:
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)`
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
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.
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
52n −1 is divisible by 24 for all n ∈ N.
32n+7 is divisible by 8 for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
Given \[a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and } a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right)\] for n ≥ 2, where a > 0, A > 0.
Prove that \[\frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1}\]
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 { 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 .} \]
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 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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:
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, for all n ∈ N
2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n
Answer the following:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
Answer the following:
Prove by method of induction
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 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:
`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 2.
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:
For any natural number n, 7n – 2n is divisible by 5.
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:
n2 < 2n for all natural numbers n ≥ 5.
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 that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
