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
464 views
in Permutations by (42.8k points)
closed by

Prove that 1 + 1. 1P1 + 2. 2P2 + 3. 3P3 + …. n. nPn = n+1Pn+1.

1 Answer

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

To Prove 1 + 1. 1P1 + 2. 2P2 + 3. 3P3 + …. n. nPn = n+1Pn+1.

Formula Used: 

Total number of ways in which n objects can be arranged in r places (Such that no object is replaced) is given by

 nPr = \(\frac{n!}{(n-r)!}\)

1 + 1. 1P1 + 2. 2P2 + 3. 3P3 + …. n. nPn = n+1Pn+1

1 + (2! - 1!) + (3! - 2!) + (4! - 3!) + …….((n + 1)! - n!) = (n + 1)! 

1 + ((n + 1)! - 1!) = (n + 1)! 

(n + 1)! = (n + 1)! 

Hence proved.

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.

...