SCHWEITZER 2002 Problem 1
For an arbitrary ordinal number let denote the set of functions that map all but finitely many elements of to . Order according to the last difference, that is, for let if holds for the maximum ordinal number with . Prove that the ordered set is scattered (i.e. it doesn't contain a subset isomorphic to the set of rational numbers with the usual order), and that any scattered order type can be embedded into some .
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.