Advertisements
Advertisements
Question
Advertisements
Solution
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
RELATED QUESTIONS
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:
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: x2n – y2n is divisible by x + y.
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
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)`
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 152n–1 + 1 is divisible by 16, for all n ∈ N.
Answer the following:
Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N
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 statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
A student was asked to prove a statement P(n) by induction. He proved that P(k + 1) is true whenever P(k) is true for all k > 5 ∈ N and also that P(5) is true. On the basis of this he could conclude that P(n) is true ______.
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:
n2 < 2n for all natural numbers n ≥ 5.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
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 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, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
State whether the following statement is true or false. Justify.
Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.
