2002 IMO Shortlist Problems/N1

Revision as of 14:53, 24 March 2007 by Scorpius119 (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


What is the smallest positive integer $t$ such that there exist integers $x_1,x_2,\ldots,x_t$ with



Observe that $2002^{2002}\equiv 4^{2002}\equiv 64^{667}\cdot 4\equiv 4\pmod{9}$. On the other hand, each cube is congruent to 0, 1, or -1 modulo 9. So a sum of at most three cubes modulo 9 must among $0,\pm 1,\pm 2,\pm 3$ none of which are congruent to 4. Therefore $t\geq 4$.

To show that 4 is the minimum value of $t$, note that $(10\cdot 2002^{667})^3+(10\cdot 2002^{667})^3+(2002^{667})^3+(2002^{667})^3=2002^{2002}$