olymmath

Putnam 2003 A6

  • Session A

For a set SS of nonnegative integers, let rS(n)r_S(n) denote the number of ordered pairs (s1,s2)(s_1, s_2) such that s1∈Ss_1 \in S, s2∈Ss_2 \in S, s1≠s2s_1 \ne s_2, and s1+s2=ns_1 + s_2 = n. Is it possible to partition the nonnegative integers into two sets AA and BB in such a way that rA(n)=rB(n)r_A(n) = r_B(n) for all nn ?

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng

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/2003/a6 · Tag KHBA5KT6XN · Edit this page on GitHub · Keys: j next, k previous