0 votes
44 views
in Mathematical Induction by (33.5k points)
closed by

Prove the following by the principle of mathematical induction: 

32n + 2 – 8n – 9 is divisible by 8 for all n ϵ N.

1 Answer

+1 vote
by (33.5k points)
selected by
 
Best answer

Let P(n): 32n + 2 – 8n – 9 

For n = 1 

= 32.1 + 2 - 8.1 - 9 

= 81 – 17 

= 64 

Since, it is divisible by 8 

Let P(n) is true for n=k, so 

= 32k + 2 – 8k – 9 is divisible by 8 

= 32k + 2 – 8k – 9 = 8λ - - - - - (1) 

We have to show that, 

= 32k + 4 – 8(k + 1) – 9 is divisible by 8 

= 3(2k + 2) + 2 – 8(k + 1) – 9 = 8μ 

Now, 

= 32(k + 1).32 – 8(k + 1) – 9 

= (8λ + 8k + 9)9 – 8k – 8 – 9 

= 72λ + 72k + 81 - 8k - 17 using equation (1) 

= 72λ + 64k + 64 

= 8(9λ + 8k + 8) 

= 8μ 

Therefore, P(n) is true for n = k + 1 

Hence, P(n) is true for all n∈N by PMI

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

...