IrMO 2013 Problem 9
- Paper 2
We say that a doubly infinite sequence is subaveraging if for all integers n. (a) Find a subaveraging sequence in which all entries are different from each other. Prove that all entries are indeed distinct. (b) Show that if is a subaveraging sequence such that there exist distinct integers m, n such that , then there are infinitely many pairs of distinct integers i, j with .
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.