PAMO 2006 Problem 5
- Day 2
In how many ways can the integers from to be divided into three non-empty disjoint sets so that none of these sets contains a pair of consecutive integers?
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.