olymmath

Putnam 1995 A4

  • Session A

Suppose we have a necklace of nn beads. Each bead is labeled with an integer and the sum of all these labels is n−1n-1. Prove that we can cut the necklace to form a string whose consecutive labels x1,x2,…,xnx_{1},x_{2},\dots,x_{n} satisfy ∑i=1kxi≤k−1fork=1,2,…,n.\sum_{i=1}^{k} x_{i} \leq k-1 \text{for} k=1,2,\dots,n.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Kiran Kedlaya

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

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

Locator putnam/1995/a4 · Tag AF7CDZQE45 · Edit this page on GitHub · Keys: j next, k previous