MathDB
Putnam 2019 B1

Source:

December 10, 2019
PutnamPutnam 2019

Problem Statement

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.
Back to ProblemsView on AoPS