olymmath

Putnam 2019 B1

  • Session B

Denote by Z2\mathbb{Z}^2 the set of all points (x,y)(x,y) in the plane with integer coordinates. For each integer n≥0n \geq 0, let PnP_n be the subset of Z2\mathbb{Z}^2 consisting of the point (0,0)(0,0) together with all points (x,y)(x,y) such that x2+y2=2kx^2 + y^2 = 2^k for some integer k≤nk \leq n. Determine, as a function of nn, the number of four-point subsets of PnP_n whose elements are the vertices of a square.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by 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/2019/b1 · Tag G90CFV0QT5 · Edit this page on GitHub · Keys: j next, k previous