Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am trying to prove that the congruence $3x^3+4y^3+5z^3 \equiv 0 \pmod{p}$ is solvable for all primes p. I proved it using primitive root, but my professor in number theory told me that it can be more directly done using the hasse-weil theorem in the theory of elliptic curves, but i cant do it. Would someone kindly show me how to make use of the hasse-weil theorem, please? Thank you in advance.

share|improve this question
1  
possibly related –  Old John Nov 10 '13 at 18:24
1  
You did consider $x=y=z=0$ I presume? –  WimC Nov 10 '13 at 19:23
2  
@WimC, no, this is nontrivial solutions. Famous example of Selmer on failure of Hasse-Minkowski once we leave quadratic forms. en.wikipedia.org/wiki/Hasse_principle –  Will Jagy Nov 10 '13 at 20:26
    
books.google.com/… –  Will Jagy Nov 10 '13 at 20:31
    
apparently in this: books.google.com/… –  Will Jagy Nov 10 '13 at 20:48

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.