Guichard-Combinatorics-Graph-Theory · Problem 2.2.1

Inclusion-Exclusion

Mathematics — Probability · derangements-recurrence

Problem

Prove that Dn=nDn−1+(−1)nD_n = nD_{n-1} + (-1)^n when n≥1n \geq 1, by induction on nn.

Browse the problem library