# Expressing $2002^{2002}$ as a sum of cubes

This is the problem: Determine the smallest positive integer $k$ such that there exist integers $x_1, x_2 , \ldots , x_k$ with ${x_1}^3+{x_2}^3+{x_3}^3+\cdots+{x_k}^3=2002^{2002}$. How to approach these kind of problems?? Thanks in advance!!

-
Well, since $2002^{2001}$ is a cube number, certainly $k = 2002$ is possible, and I'm sure it's possible to do better... – Ben Millwood Jun 26 '12 at 12:40
@BenMillwood You can get $k=4$ with $x_1 = x_2 = 2002^{667}$ and $x_3 = x_4 = 10*2002^{667}$. I suspect this is the smallest possibility but I don't have a proof. – Cocopuffs Jun 26 '12 at 12:44
@Cocopuffs: ah, that is a much more intelligent way to start... I suppose part of the problem is that the $x_i$ need not be positive? – Ben Millwood Jun 26 '12 at 12:47
The smallest positive integer is $1$ </only read title> – Neal Jun 26 '12 at 13:17
Where did you get the problem? – Colonel Panic Jun 26 '12 at 15:16

$k=4$ is the smallest:

Certainly, it can be done using 4 cubes, by noticing that $2002 = 10^3 + 10^3 + 1^3 +1^3$, and then using $2002^{2002} = 2002 \times 2002^{2001} = (10^3 + 10^3 + 1^3 +1^3)\times (2002^{667})^3$, and multiplying out the brackets.

Since the number can be represented by 4 cubes, it suffices to show that it cannot be done with less than 4.

Since $2002 \equiv 4 \pmod 9$ we have $2002^3 \equiv 64 \equiv 1 \pmod 9$ so that $2002^{3n} \equiv 1 \pmod 9$ and so the original number is equivalent to 4 (mod 9).

Looking at cubes mod 9, they are equivalent to 0, 1 or -1, so at least 4 are required for any number equivalent to $4 \pmod 9$.

-
+1. But how did you prove $k=4$ is the smallest? – N.S.JOHN Apr 28 at 2:44
The very last sentence of the answer proves that $4$ is the smallest: it is impossible to get the correct residue (mod 9) with 3 or less. – Old John Apr 28 at 6:05