This paper features a combinatorial proof that, for each n, the following two events have
equal probabilities
(i) a permutation is chosen at random from among those of n letters,
and it has an even number of cycles, all of whose lengths are odd,
(ii) a coin is tossed n times and exactly n/2 heads occur.
