CGMO 2017 Problem 6
Given a finite set , two positive integers , and a map . Define , . It is known that for any , . Define the number of satisfying . Prove that: (1) (2) is a non-negative integer.
Dataset text AI-MO AoPS. 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.