Maths Olympiad Prep

Library / /3 of 6

Combinatorics Difficulty 4.7 AIME Prove it Brazil

SS is a (k+1)×(k+1)(k+1) \times (k+1) array of lattice points. How many squares have their vertices in SS?

Solution

The key is to consider how many squares have their vertices on the perimeter of a given (n+1)×(n+1)(n+1) \times (n+1) array whose sides are parallel to the sides of the array.

Figure 1

The diagram shows that there are nn such squares. There are (k+1n)2(k+1-n)^2 such arrays. So the total number of squares is k12+(k1)22++1k2=1k(k+1i)i2=(k+1)k(k+1)(2k+1)6k2(k+1)24=k(k+1)2(k+2)12k \cdot 1^2 + (k-1)^2 \cdot 2 + \cdots + 1 \cdot k^2 = \sum_{1}^{k}(k+1-i)i^2 = \frac{(k+1)k(k+1)(2k+1)}{6} - \frac{k^2(k+1)^2}{4} = \frac{k(k+1)2(k+2)}{12}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.