olymmath

Putnam 2022 B3

  • Session B

Assign to each positive real number a color, either red or blue. Let DD be the set of all distances d>0d > 0 such that there are two points of the same color at distance dd apart. Recolor the positive reals so that the numbers in DD are red and the numbers not in DD are blue. If we iterate this recoloring process, will we always end up with all the numbers red after a finite number of steps?

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/2022/b3 · Tag A3FYWBK2X5 · Edit this page on GitHub · Keys: j next, k previous