Question: (a) In how many ways can the integers 1, 2, 3, . . . , n be arranged in a line so that none of
(b) Show that the result in part (a) equals dn-1 + dn. (dn = the number of derangements of 1, 2, 3, ..., n.)
Step by Step Solution
3.37 Rating (153 Votes )
There are 3 Steps involved in it
a For 1 i n 1 let c i denote the occurrence of the pattern ii ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
954-M-L-A-L-S (7955).docx
120 KBs Word File
