English

n 11 11 + n 5 5 + n 3 3 + 62 165 n is a positive integer for all n ∈ N. - Mathematics

Advertisements
Advertisements

Question

n1111+n55+n33+62165n is a positive integer for all n ∈ N

 

Solution

Let P(n) be the given statement.
Now, 

P(n):n1111+n55+n33+62165n is a positive integer for all nN.

 Step 1:

P(1)=111+15+13+62165=15+33+55+62165=165165=1

 It is certainly a positive integer .

 Hence, P(1) is true .

 Step2: 

 Let P(m) be true .

 Then, m1111+m55+m33+62165m is a positive integer . 

 Now, let m1111+m55+m33+62165m=λ, where λN is a positive integer . 

 We have to show that P(m + 1) is true whenever P(m) is true .

 To prove: (m+1)1111+(m+1)55+(m+1)33+62165(m+1) is a positive integer .

 Now, 

(m+1)1111+(m+1)55+(m+1)33+62165(m+1)

=111(m11+11m10+55m9+165m8+330m7+462m6+462m5+330m4+165m3+55m2+11m+1)

+15(m5+5m4+10m3+10m2+5m+1)+13(m3+3m2+3m+1)

+62165m+62165

=[m1111+m55+m33+62165m]+m10+5m9+15m8+30m7+42m6+42m5+31m4+17m3+8m2+3m+111+15+13+6105

=λ+m10+5m9+15m8+30m7+42m6+42m5+31m4+17m3+8m2+3m+1

 It is a positive integer .

 Thus, P(m + 1) is true .

 By the principle of mathematical induction, P(n) is true for all n N.

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

APPEARS IN

RD Sharma Mathematics [English] Class 11
Chapter 12 Mathematical Induction
Exercise 12.2 | Q 33 | Page 28

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

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

1+3+32+...+3n1=(3n-1)2


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

1.3 + 2.3^3 + 3.3^3  +...+ n.3^n = (2n-1)3n+1+34

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

12.5+15.8+18.11+...+1(3n-1)(3n+2)=n6n+4

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

1/1.2.3 + 1/2.3.4 + 1/3.4.5 + ...+ 1n(n+1)(n+2)=n(n+3)4(n+1)(n+2)

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

(1+11)(1+12)(1+13)...(1+1n)=(n+1)


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

12+32+52+...+(2n-1)2=n(2n-1)(2n+1)3

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.


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

 

1.3 + 2.4 + 3.5 + ... + n. (n + 2) = 16n(n+1)(2n+7)

 

1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =n(4n2+6n1)3

 

n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.

 

(2n)!22n(n!)213n+1  for all n ∈ N .


1+14+19+116+...+1n2<21n for all n ≥ 2, n ∈ 

 


 Prove that 1n+1+1n+2+...+12n>1324, for all natural numbers n>1.

 


 A sequence a1,a2,a3,... is defined by letting a1=3 and ak=7ak1 for all natural numbers k2. Show that an=37n1 for all nN.


 A sequence x1,x2,x3,... is defined by letting x1=2 and xk=xk1k for all natural numbers k,k2. Show that xn=2n! for all nN.


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

(23n − 1) is divisible by 7


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

3n − 2n − 1 is divisible by 4


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

5 + 52 + 53 + .... + 5n = 54(5n-1)


Answer the following:

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

8 + 17 + 26 + … + (9n – 1) = n2(9n+7)


Answer the following:

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

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


Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

1 + 3 + 5 + ... + (2n – 1) = n2 


Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.

Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.


Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = sin(α+n-12β)sin(nβ2)sin(β2)


Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.


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 – 7n + 3 is divisible by 3, 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:

2 + 4 + 6 + ... + 2n = n2 + n 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.


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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×
Our website is made possible by ad-free subscriptions or displaying online advertisements to our visitors.
If you don't like ads you can support us by buying an ad-free subscription or please consider supporting us by disabling your ad blocker. Thank you.