Show 3x2+2=y2 has no solution in integers.
I've seen from similar problems, the idea is to reduce the equation to a congruence mod3 and show that the congruence y2≡2(mod3) has no solutions.
Why is one able to reduce the problem in this manner?
Answer
Start from basics,
What does the representation a≡b(modc) mean in the first place?
Answer : It means (b−a) is divisible by c, or in a fancy way, it's written as c∣(b−a)
For your question, you can clearly see that if 3x2+2=y2 is true it would imply y2−2=3x2. Which, therefore implies that y2−2 is a multiple of 3.
Therefore 3∣y2−2⟹y2≡2(mod3)
So if you could prove, somehow, that this ain't possible, it would prove that the equation has no solution in integers.
No comments:
Post a Comment