SCHWEITZER 1985 Problem 10
Show that any two intervals of positive lengths can be countably disected into each other, that is, they can be written as countable unions and of pairwise disjoint sets, where and are congruent for every [Gy. Szabo]
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.