Question: (a) In how many ways can the integers 1, 2, 3, . . . , n be arranged in a line so that none of

(a) In how many ways can the integers 1, 2, 3, . . . , n be arranged in a line so that none of the patterns 12, 23, 34,..., (n - 1)n occurs?
(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

1 Expert Approved Answer
Step: 1 Unlock

a For 1 i n 1 let c i denote the occurrence of the pattern ii ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (7955).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!