CMO 1996 Problem 3
- Paper
We denote an arbitrary permutation of the integers , , , by , , , . Let denote the number of these permutations such that:
(1) ;
(2): , .
Determine whether is divisible by 3.
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.