HMMT 2003 T2

Suppose $A$ is a set with $n$ elements, and $k$ is a divisor of $n$ . Find the number of consistent $k$ -configurations of $A$ of order 1 .

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

\frac{n!}{(n / k)!(k!)^{n / k}}

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.