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:
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:
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 "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.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
\[\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.
32n+7 is divisible by 8 for all n ∈ N.
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 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:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Prove by method of induction, for all n ∈ N:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
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:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.
Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
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:
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:
n2 < 2n for all natural numbers n ≥ 5.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
A sequence a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.
A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ 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 ______.
