Advertisements
Advertisements
प्रश्न
Advertisements
उत्तर
Let P(n) be the given statement.
Now,
\[P(n): \frac{n^7}{7} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{n^2}{2} - \frac{37}{210}n \text{ is a positive integer .} \]
\[\text{ Step 1:} \]
\[P(1) = \frac{1}{7} + \frac{1}{5} + \frac{1}{3} + \frac{1}{2} - \frac{37}{210} = \frac{30 + 42 + 70 + 105 - 37}{210} = \frac{210}{210} = 1 \]
\[\text{ It is a positive integer .} \]
\[\text{ Thus, P(1) is true } . \]
\[\text{ Step } 2: \]
\[\text{ Let P(m) be true } . \]
\[\text{ Then } , \frac{m^7}{7} + \frac{m^5}{5} + \frac{m^3}{3} + \frac{m^2}{2} - \frac{37}{210}m \text{ is a positive integer } . \]
\[Let \frac{m^7}{7} + \frac{m^5}{5} + \frac{m^3}{3} + \frac{m^2}{2} - \frac{37}{210}m = \lambda \text{ for some } \lambda \in \text{ positive } N . \]
\[\text{ To show: } P\left( m + 1 \right) \text { is a positive integer } . \]
\[\text{ Now } , \]
\[P(m + 1) = \frac{\left( m + 1 \right)^7}{7} + \frac{\left( m + 1 \right)^5}{5} + \frac{\left( m + 1 \right)^3}{3} + \frac{\left( m + 1 \right)^2}{2} - \frac{37}{210}\left( m + 1 \right)\]
\[ = \frac{1}{7}\left( m^7 + 7 m^6 + 21 m^5 + 35 m^4 + 35 m^3 + 21 m^2 + 7m + 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{1}{2}\left( m^2 + 2m + 1 \right) - \frac{37}{210}m - \frac{37}{210} \]
\[ = \left[ \frac{m^7}{7} + \frac{m^5}{5} + \frac{m^3}{3} + \frac{m^2}{2} - \frac{37}{210}m \right] + m^6 + 3 m^5 + 6 m^4 + 7 m^3 + 6 m^2 + 4m\]
\[ = \lambda + m^6 + 3 m^5 + 6 m^4 + 7 m^3 + 6 m^2 + 4m\]
\[\text{ It is a positive integer, as \lambda is a positive integer } . \]
\[\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
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`
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 + 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:
`(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: `1+2+ 3+...+n<1/8(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.
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
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+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn 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}\]
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
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 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:
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:
`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:
(23n − 1) is divisible by 7
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 152n–1 + 1 is divisible by 16, for all n ∈ N.
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 ______.
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`
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:
4n – 1 is divisible by 3, for each natural number n.
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 the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers 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 number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
By using principle of mathematical induction for every natural number, (ab)n = ______.
