Let n be an integer greater than 1. In the Cartesian coordinate system we consider all squares with integer vertices (x,y) such that 1≤x,y≤n. Denote by pk (k=0,1,2,…) the number of pairs of points that are vertices of exactly k such squares. Prove that ∑k(k−1)pk=0. analytic geometrycombinatorics proposedcombinatorics