Posted by **Sean** on Wednesday, August 19, 2009 at 6:54am.

Can someone use mod to prove that 10^(3n + 1) cannot be represented as the sum of two cubes.

And make it very detailed please.

## Answer this Question

## Related Questions

- Maths - Prove that a number 10^(3n+1) , where n is a positive integer, cannot be...
- maths - can you answer this question: prove that a number 10^(3n+1), where n is ...
- math - Which two is true as i'm confused A) 3+7 10 mod 15 17 + 9 4 mod 21 ...
- math - Prove that a number 10^(3n+1) , where n is a positive integer, cannot be ...
- Algebra - Which special case is represented by x^2-121? A. the difference of two...
- MATHS - Does there exist a five digit number abcde such that it is equal to the ...
- A number thoery question - Please help me! Thank you very much. Prove Fermat's ...
- math - can you answer this question in a different and more logical way than ...
- Math (Proof) - Prove that if ab = ac (mod n) and a is relatively prime to n, ...
- Math - Which Statements of congruence are true and which are false and why? 177 ...