CWMO 2002 Problem 8
Assume that consists of and and is the longest sequence of number, which satisfies the following condition: Every two sections of successive terms in the sequence of numbers are different, i.e., for arbitrary , and are different. Prove that the first four terms and the last four terms in the sequence are the same.
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.