Combinatorics and Graph Theory · Problem 2.2.9

Inclusion-Exclusion — David Guichard

Mathematics — Combinatorics · circular-derangements

Problem

Repeat the previous problem with nn instead of 8.

Browse the problem library