USAMO 1997 Problem 6 Day 2 Suppose the sequence of nonnegative integers a1,a2,…,a1997a_1, a_2, \ldots, a_{1997}a1,a2,…,a1997 satisfies ai+aj≤ai+j≤ai+aj+1a_i + a_j \leq a_{i+j} \leq a_i + a_j + 1ai+aj≤ai+j≤ai+aj+1 for all i,j≥1i,j \geq 1i,j≥1 with i+j≤1997i + j \leq 1997i+j≤1997 . Show that there exists a real number xxx such that an=⌊nx⌋a_n = \lfloor nx \rflooran=⌊nx⌋ (the greatest integer ≤nx\leq nx≤nx ) for all 1≤n≤19971 \leq n \leq 19971≤n≤1997 . 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. Add a solution PreviousProblem 4 Locator usamo/1997/p6 · Tag JW44B5FFAQ · Edit this page on GitHub · Keys: j next, k previous