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
2.7k views
in Mathematical Induction by (22.8k points)
reopened by

For all integers n \(\geq\) 1, which of the following is divisible by 9?

(a) 8n + 1 

(b) 10n + 1 

(c) 4n – 3n + 1

 (d) 32n + 3n + 1

Please log in or register to answer this question.

1 Answer

+1 vote
by (23.8k points)

Answer: (C) 4n-3n+1

For n = 1, 

8n + 1 = 81 + 1 = 9 divisible by 9 

10n + 1 = 101 + 1 = 11 not divisible by 9 

4n – 3n – 1 = 4 – 3 – 1 = 0 divisible by 9 

32n + 3n + 1 = 13 not divisible by 9 

For n = 2

8n + 1 = 82 + 1 = 65 not divisible by 9 

4n – 3n – 1 = 42 – 3 × 2 – 1 = 16 – 6 – 1 = 9 divisible by 9 

∴ We need to prove 4n – 3n – 1 to be divisible by 9 ∀ n∈N. 

using mathematical induction. 

Let T(n): 4n – 3n – 1 is divisible by 9, 

Basic Step: 

T(1) = 0 which is divisible by 9 

⇒ T(1) is true. 

Induction Step: 

Assume T(k) to be true, i.e., 

4k – 3k – 1 is divisible by 9 k∈N 

⇒ 4k – 3k – 1 = 9m, m∈N ...(i) 

∴ 4k + 1 – 3(k + 1) – 1 = 4.4k – 3k – 3 – 1 = 4.4k – 3k – 4 

= 4(4k – 3k – 1) + 9k = 4.9m + 9k = 9 (4m + k) 

⇒ 4k + 1 – 3 (k + 1) – 1 is divisible by 9 

⇒ T (k + 1) is true whenever T(k) is true, k∈N 

⇒ 4n + 3n – 1 is divisible by 9 ∀ 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.

...