Grinstead-Snell-Probability · Problem 3.1.6

Combinatorics

Mathematics · permutations

Problem

In arranging people around a circular table, we take into account their seats relative to each other, not the actual position of any one person. Show that nn people can be arranged around a circular table in (n−1)!(n-1)! ways.

Related theory

Browse the problem library