HMMT 2006 T5
- Team 1
With the same lawn and the same allowable mobot orientations as in the previous problem, let us call a formation "happy" if it is invariant under rotations. (A rotation applies both to the positions of the mobots and to their orientations.) An example of a happy formation for might be

Find the number of happy formations for a given .
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.