Necklaces, subset sums, and cyclic permutations

Robert Dougherty-Bliss, Sergi Elizalde

It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots ,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$.…