Combinatorics and Graph Theory · Problem 2.2.8

Inclusion-Exclusion — David Guichard

Mathematics — Combinatorics · circular-derangements

Problem

A small merry-go-round has 8 seats occupied by 8 children. In how many ways can the children change places so that no child sits behind the same child as on the first ride? The seats do not matter, only the relative positions of the children.

Browse the problem library