Suppose a1,a2,⋯ is a non-decreasing sequence of positive integers. For , define , which means is the smallest such that . Given , find the maximum value of
,
an
,
⋯
m≥1
bm=min{n∣an≥m}
bm
n
an≥m
a19=85
a1+a2+⋯+a19+b1+b2+⋯+b85
(1985 USAMO problem).
MathematicsOlympiadOlympiad #775
Sign in to check your answer and unlock the solution.