Putnam 2003 A6
- Session A
For a set of nonnegative integers, let denote the number of ordered pairs such that , , , and . Is it possible to partition the nonnegative integers into two sets and in such a way that for all ?
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.