BALTIC-WAY 1995 Problem 11
- Answer
In how many ways can the set of integers be partitioned into three nonempty sets so that none of these sets contains two consecutive integers?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
2^{1993}-1
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.