English

N 7 7 + N 5 5 + N 3 3 + N 2 2 − 37 210 N is a Positive Integer for All N ∈ N.

Advertisements
Advertisements

Question

\[\frac{n^7}{7} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{n^2}{2} - \frac{37}{210}n\] is a positive integer for all n ∈ N.  

 

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 . \]

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Mathematical Induction - Exercise 12.2 [Page 28]

APPEARS IN

R.D. Sharma Mathematics [English] Class 11
Chapter 12 Mathematical Induction
Exercise 12.2 | Q 32 | Page 28

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

Prove the following by using the principle of mathematical induction for all n ∈ N

`1+ 1/((1+2)) + 1/((1+2+3)) +...+ 1/((1+2+3+...n)) = (2n)/(n +1)`

Prove the following by using the principle of mathematical induction for all n ∈ N

1.3 + 3.5 + 5.7 + ...+(2n -1)(2n + 1) = `(n(4n^2 + 6n -1))/3`

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

`1/2.5 + 1/5.8 + 1/8.11 + ... + 1/((3n - 1)(3n + 2)) = n/(6n + 4)`

Prove the following by using the principle of mathematical induction for all n ∈ N

(1+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 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/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 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.


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.


12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .

 

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}\]


1.2 + 2.22 + 3.23 + ... + n.2= (n − 1) 2n+1+2

 

52n −1 is divisible by 24 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.

 

7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]

 

\[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ and  \[0 < x < \frac{\pi}{2}\]

 


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


\[\text{ Prove that } \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ 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:

13 + 33 + 53 + .... to n terms = n2(2n2 − 1)


Prove by method of induction, for all n ∈ N:

`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N


Answer the following:

Prove, by method of induction, for all n ∈ N

`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`


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:

`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.


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:

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 that for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin  beta/2)`.


If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.


If P(n): 2n < n!, n ∈ N, then P(n) is true for all 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.


Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×