Hey, first post and all so maybe someone can help me out with a question from my Number Theory class. It's in the Congruences chapter.
Prove that if n is congruent to 4 (mod 9), then n cannot be written as the sum of 3 cubes.
Thanks in advance for the help!
That's essentially all there is, it's just an exhaustive search. Maybe there's a more elegant way, I don't know. You can list systematically and for each easily verify the sum is not 4 mod 9.
000
001
008
011
018
088
111
118
188
888
Edit: I'm not sure if it's a typo when you wrote that a sum of cubes can't be congruent to 4 mod 9... of course if we have four cubes then we can just choose 1+1+1+1.