For n Z+, dn denotes the number of derangements of {1, 2, 3, . . ., n],
Question:
(a) If n > 2, show that dn satisfies the recurrence relation
dn = (n - l)(dn-1 + dn-2), d2 = l, d1 = 0.
(b) How can we define d0 so that the result in part (a) is valid for n ¥ 2?
(c) Rewrite the result in part (a) as dn - ndn-1 = - [dn-1= (n-l )dn-2] .
How can dn - ndn-1 be expressed in terms of dn-2, dn-3?
(d) Show that dn - ndn-1 = (-1)n.
(e) Let f(x) = n=0(dnxn)/n!. After multiplying both sides of the equation in part (d) by xn/n! and summing for n ¥ 2, verify that f(x) = (e-x) / (1 - x ). Hence
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Question Posted: