olymmath

BALKAN 1999 Problem 4

  • Paper

Let {an}n≥0\{a_n\}_{n\geq 0} be a non-decreasing, unbounded sequence of non-negative integers with a0=0a_0=0 . Let the number of members of the sequence not exceeding nn be bnb_n . Prove that (a0+a1+⋯+am)(b0+b1+⋯+bn)≥(m+1)(n+1).(a_0 + a_1 + \cdots + a_m)( b_0 + b_1 + \cdots + b_n ) \geq (m + 1)(n + 1).

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

Similar problems

These problems have the most words in common with this statement.

Locator balkan/1999/p4 · Tag RC4CZMR7NS · Edit this page on GitHub · Keys: j next, k previous