मराठी

2.7n + 3.5n − 5 is Divisible by 24 for All N ∈ N.

Advertisements
Advertisements

प्रश्न

2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.

बेरीज
Advertisements

उत्तर

Given expression

2.7n + 3.5n - 5

Proof – Let, P(n) = 2.7n + 3.5n - 5 is divisible by 24.

We note that P (n) is true when n = 1,

Since P (1) = 14 + 15 – 5 = 24 which is divisible by 24.

Assume that it is true for P (k).

i.e. P(k) = 2.7k + 3.5k - 5 = 24q     ......(1) when q ∈ N

Now according to the mathematical induction principle, we have to prove it is also true for P (k + 1) whenever p (k) is true.

Now substitute in place of k, (k + 1) we have,

⇒ P(k + 1) = 2.7k+1 + 3.5k+1 - 5

⇒ 2.7.7k + 3.5.5k - 5

Now add and subtract by 3.7.5k - 7.5 we have,

⇒ 2.7.7k + 3.5.5k - 5 + 3.7.5k - 7.5 - (3.7.5k - 7.5)

⇒ 7(2.7k + 3.5k - 5) + 3.5.5k - 5 - (3.7.5k - 7.5)

Now from equation (1) we have,

⇒ 7(24q) + 3.5.5k - 5 - 3.7.5k + 7.5

⇒ 7(24q) - 2.3.5k - 5 + 35

⇒ 7(24q) - 2.3.5k + 30

⇒ 7(24q) - 6(5k - 5)

Now as we know that (5k - 5) is a multiple of 4 so in place of that we can write (4p) where (p) belongs to the natural number.

⇒ 7(24q) - 6(4p)

⇒ 24(7q - p)

So as we see this is a multiple of 24.

Thus P (k + 1) is true whenever P (k) is true.

So according to the principle of mathematical induction 2.7k + 3.5k - 5  is divisible by 24.

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

APPEARS IN

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

व्हिडिओ ट्यूटोरियल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: 

(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/3.5 + 1/5.7 + 1/7.9 + ...+ 1/((2n + 1)(2n +3)) = n/(3(2n +3))`

Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 3.


Prove the following by using the principle of mathematical induction for all n ∈ N: x2n – y2n is divisible by x + y.


Given an example of a statement P (n) such that it is true for all n ∈ N.

 

\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]

 


\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 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.

 

32n+2 −8n − 9 is divisible by 8 for all n ∈ N.


(ab)n = anbn for all n ∈ N. 

 

72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.

 

11n+2 + 122n+1 is divisible by 133 for all n ∈ N.

 

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

 

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

 


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

 


\[\text{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{  is true for all n }  \in N?\]


\[\text{ Using principle of mathematical induction, prove that } \sqrt{n} < \frac{1}{\sqrt{1}} + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + . . . + \frac{1}{\sqrt{n}} \text{ for all natural numbers } n \geq 2 .\]

 


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)`


Answer the following:

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

2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n 


Answer the following:

Prove by method of induction loga xn = n logax, x > 0, 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 statement by using the Principle of Mathematical Induction for all n ∈ N, that:

2n + 1 < 2n, for all natual numbers n ≥ 3.


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.


Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers 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"):}`


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:

32n – 1 is divisible by 8, 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.


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.


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.


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


Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.


If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×