मराठी

Prove that N3 - 7n + 3 is Divisible by 3 for All N ∈ N .

Advertisements
Advertisements

प्रश्न

Prove that n3 - 7+ 3 is divisible by 3 for all n \[\in\] N .

  
Advertisements

उत्तर

\[\text{ Let } p\left( n \right) = n^3 - 7n + 3 \text{ is divisible by } 3 \forall n \in N . \]

\[\text{ Step I: For }  n = 1, \]

\[p\left( 1 \right) = 1^3 - 7 \times 1 + 3 = 1 - 7 + 3 = - 3, \text{ which is clearly divisible by } 3\]

\[\text{ So, it is true for n } = 1\]

\[\text{ Step II: For }  n = k, \]

\[\text{ Let } p\left( k \right) = k^3 - 7k + 3 = 3m, \text{ where m is any integer, be true } \forall   k \in N . \]

\[\text{ Step III: For }  n = k + 1, \]

\[p\left( k + 1 \right) = \left( k + 1 \right)^3 - 7\left( k + 1 \right) + 3\]

\[ = k^3 + 3 k^2 + 3k + 1 - 7k - 7 + 3\]

\[ = k^3 + 3 k^2 - 4k - 3\]

\[ = k^3 - 7k + 3 + 3 k^2 + 3k - 6\]

\[ = 3m + 3\left( k^2 + k + 2 \right) \left[ \text{ Using step }  II \right]\]

\[ = 3\left( m + k^2 + k + 2 \right)\]

\[ = 3p, \text{ where p is any integer } \]

\[\text{ So,}   p\left( k + 1 \right) \text{ is divisible by } 3 .\]

Hence, n3  - 7+ 3 is divisible by 3 for all n \[\in\] N .

 

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 12: Mathematical Induction - Exercise 12.2 [पृष्ठ २८]

APPEARS IN

आर.डी. शर्मा Mathematics [English] Class 11
पाठ 12 Mathematical Induction
Exercise 12.2 | Q 29 | पृष्ठ २८

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्‍न

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

`a + ar + ar^2 + ... + ar^(n -1) = (a(r^n - 1))/(r -1)`

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 "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.


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

 

1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.

 

\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]


12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]

 

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

 


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.

 

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.


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

 

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

 


\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer for all n ∈ N

 


\[\sin x + \sin 3x + . . . + \sin (2n - 1)x = \frac{\sin^2 nx}{\sin x}\]

 


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:

Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1


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.


Answer the following:

Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N


Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by

Sn = `{{:((n(n + 1)^2)/2",",  "if n is even"),((n^2(n + 1))/2",",  "if n is odd"):}`


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:

23n – 1 is divisible by 7, for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

n3 – n is divisible by 6, for each natural number n ≥ 2.


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, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin  ((n + 1))/2 theta)/(sin  theta/2)`, for all n ∈ N.


Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.


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


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×