olymmath

Putnam 1973 B1

  • Session B

Let a1,a2,…a2n+1a_1, a_2, \ldots a_{2n+1} be a set of integers such that, if any one of them is removed, the remaining ones can be divided into two sets of nn integers with equal sums. Prove a1=a2=⋯=a2n+1.a_{1}=a_2 =\cdots=a_{2n+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 putnam/1973/b1 · Tag XX3FGCVPV2 · Edit this page on GitHub · Keys: j next, k previous