4
Part of 1995 Putnam
Problems(2)
Putnam 1995 A4
Source:
7/1/2014
Suppose we have a necklace of beads. Each bead is labelled with an integer and the sum of all these labels is . Prove that we can cut the necklace to form a string whose consecutive labels satisfy
\sum_{i=1}^{k}x_i\le k-1 \forall \;\;1\le k\le n
Putnamcollege contests
Putnam 1995 B4
Source:
7/1/2014
Evaluate :
Express your expression in the form where .
Putnaminductioncontinued fractioncollege contests