Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2026 Crash Course
NEET 2026 Crash Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
768 views
in Principle of Mathematical Induction by (15.4k points)

For all n ≥ 1 , prove that p(n): n(n + 1 )(n + 5) is divisible by 3.

Please log in or register to answer this question.

1 Answer

0 votes
by (15.9k points)

p(1): 1(1 + 1)(1 + 5) = 12divisible by 3, hence true. 

Assuming that true for p(k)

p(k): k(k + 1)(k + 5) is divisible by 3.

k(k + 1)(k + 5) = 3M

p(k + 1): (k + 1)(k + 2)(k + 6)

= (k + 1)(k2 + 8k + 12)

= (k + 1)(k2 + 5k + 3k +12)

= (k + 1)[k(k + 5) + 3(k + 6)]

= [k(k + 1)(k + 5) + 3(k + 1)(k + 6)]

= [3M + 3(k + 1)(k + 6)]

= 3[M + (k + 1)(k + 6)]

Hence divisible by 3. 

Therefore by using the principle of mathematical induction 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.

...