let $D_n$ be a number of Derangement of n items . prove that $D_n$ is odd if and only if n is even . i was trying to use induction on the $!n=(n-1)(!(n-1)+!(n-2))$ recurrence relation but i cant ...
I have a discrete math question here but im not sure how to approach it with inclusion-exclusion. Can someone help me out? Consider a party of 60 persons. Assume that each person knows more than m ...