Maths Olympiad Prep

Library / /223 of 520

Number theory Difficulty 5.1 AIME, harder Find the answer

3. Arrange nn squares of different sizes without overlapping, so that the total area of the resulting figure is exactly 2,006. The minimum value of nn is \qquad \therefore.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

3.3.

Let the side lengths of nn squares be x1,x2,,xnx_{1}, x_{2}, \cdots, x_{n}, then x12+x22++xn2=2006x_{1}^{2}+x_{2}^{2}+\cdots+x_{n}^{2}=2006.
Since xi20x_{i}^{2} \equiv 0 or 1(mod4)1(\bmod 4), and 20062(mod4)2006 \equiv 2(\bmod 4), there must be at least two odd numbers among xix_{i}.
If n=2n=2, then x1x_{1} and x2x_{2} are both odd, let them be 2p+12 p+1 and 2q+12 q+1, then (2p+1)2+(2q+1)2=2006(2 p+1)^{2}+(2 q+1)^{2}=2006.
Thus, p2+p+q2+q=501p^{2}+p+q^{2}+q=501.
However, p2+pp^{2}+p and q2+qq^{2}+q are both even, which is a contradiction.
If n=3n=3, we can set
x1=2p+1,x2=2k,x3=2q+1 x_{1}=2 p+1, x_{2}=2 k, x_{3}=2 q+1 \text {, }

then (2p+1)2+(2k)2+(2q+1)2=2006(2 p+1)^{2}+(2 k)^{2}+(2 q+1)^{2}=2006,
which means p2+p+k2+q2+q=501p^{2}+p+k^{2}+q^{2}+q=501.
Clearly, kk is odd and k501k \leqslant \sqrt{501}. Hence k21k \leqslant 21.
When k=1k=1, p2+p+q2+q=500p^{2}+p+q^{2}+q=500 has no positive integer solutions;
When k=3k=3, p2+p+q2+q=492p^{2}+p+q^{2}+q=492 has solutions p=8,q=20p=8, q=20.
Thus, 172+62+412=200617^{2}+6^{2}+41^{2}=2006. Therefore, nmin=3n_{\min }=3.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.