VN-TST 2005 Problem 6
is called diamond 2005 if , e.g. . Let is increasing. Prove that contain infinite diamond 2005.
Compare with this problem.
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.