Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
708 views
in Combinatorics and Mathematical Induction by (49.2k points)
closed by

Prove by the principle of mathematical induction that for every natural number n, 32n + 2 – 8n – 9 is divisible by 8.

1 Answer

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

Let P(n): 32n + 2 – 8n – 9 is divisible by 8.

Then, P(1): 32.1 + 2 – 8.1 – 9 is divisible by 8.

(i.e.) 34 – 8 – 9 is divisible by 8 or 81 – 8 – 9 is divisible by 8

(or) 64 is divisible by 8, which is true. 

Suppose P(k) is true, then 

P(k) : 32k + 2 – 8k – 9 is divisible by 8 

(i.e.) 32k + 2 – 8k – 9 = 8m, where m ∈ N (or) 

32k + 2 = 8m + 8k + 9 

P(k + 1) is the statement given by, … (1) 

P(k + 1) : 32(k + 1) + 2 – 8(k + 1) – 9

Now,

∴ P(k + 1) is true 

Hence, by the principle of mathematical induction, P(n) is true for all n ∈ N

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.

...