How can I find integer solutions for $x^3 - y^2 = 0 $ ?
In case that there are infinite number of solutions .How can we prove that ? and how to generate first few solutions ?
Tell me more
×
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.
|
|
|||
|
|
|
Edited to match the corrected question. HINT: If $x^3=y^2$, and $x$ is an integer, then $x$ must be a perfect square. (Why?) Thus, $x^3$ must be a sixth power. Conversely, if $x^3$ is a sixth power, it’s a perfect square, and you get a solution. |
|||||||||
|
|
The highest power of any prime dividing $x^3$ must be divisible by 3 and the highest power of any prime dividing $y^2$ must be divisible by 2. So the highest power of any prime dividing $x^3=y^2$ must be divisible by 6. This implies that $x^3=y^2$ can be written as $u^6$ for some integer $u$. It then immediately follows that $x=u^2$ and $y=u^3$ and conversely each such pair $x,y$ is indeed a solution to that equation, so that is exactly the solution set. |
|||
|
|