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

Prove that the number of ways in which n books can be placed on a shelf when two particular books are never together is (n – 2) × (n – 1)!.

1 Answer

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

Regarding the two particular books as one book, there are (n – 1) books now which can be arranged in n – 1Pn –1, i.e., (n – 1)! ways. Now, these two books can be arranged amongst themselves in 2 ! ways. Hence the total number of permutations in which these two books are placed together is 2 ! . (n – 1)!. The number of permutations of n books without any restriction is n !. 

Therefore, the number of arrangements in which these two books never occur together 

= n !–2 ! .(n – 1) ! = n . (n – 1) ! – 2 . (n – 1) ! = (n – 2) . (n – 1) !

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.

...