olymmath

CMO 2000 Problem 3

  • Paper

Let A=(a1,a2,⋯ ,a2000)A = (a_1, a_2, \cdots ,a_{2000}) be a sequence of integers each lying in the interval [−1000,1000][-1000,1000] . Suppose that the entries in A sum to 11 . Show that some nonempty subsequence of AA sums to zero.

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 ca-cmo/2000/p3 · Tag XM6M22KQDK · Edit this page on GitHub · Keys: j next, k previous