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
398 views
in Combinatorics and Mathematical Induction by (49.2k points)
closed by

Prove by Mathematical Induction that 1! + (2 × 2!) + (3 × 3!) + … + (n × n!) = (n + 1)! – 1

1 Answer

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

P(n) is the statement 

1! + (2 × 2!) + (3 × 3!) + ….. + (n × n!) = (n + 1)! – 1 

To prove for n = 1 

LHS = 1! = 1 

RHS = (1 + 1)! – 1 = 2! – 1 = 2 – 1 = 1

LHS = RHS ⇒ P(1) is true 

Assume that the given statement is true for n = k 

(i.e.) 1! + (2 × 2!) + (3 × 3!) + … + (k × k!) = (k + 1)! – 1 is true 

To prove P(k + 1) is true 

p(k + 1) = p(k) + t(k + 1) 

P(k + 1) = (k + 1)! – 1 + (k + 1) × (k + 1)! 

= (k + 1)! + (k + 1) (k + 1)! – 1 

= (k + 1)! [1 + k + 1] – 1 

= (k + 1)! (k + 2) – 1 

= (k + 2)! – 1

= (k + 1 + 1)! – 1 

∴ P(k + 1) is true ⇒ P(k) is true, 

So by the principle of mathematical induction P(n) is true.

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.

...