Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How to prove that the only integral solutions to the equation $$y^{2}=x^{3}-1$$ is $x=1, y=0$. I rewrote the equation as $y^{2}+1=x^{3}$ and then we can factorize $y^{2}+1$ as $$y^{2}+1 = (y+i) \cdot (y-i)$$ in $\mathbb{Z}[i]$. Next i claim that the factor's $y+i$ and $y-i$ are co-prime. But i am not able to show this. Any help would be useful. Moreover, i would also like to see different proofs of this question.

Extending Consider the equation $$y^{a}=x^{b}-1$$ where $a,b \in \mathbb{Z}$ and $(a,b)=1$ and $a < b$. Then is there any result which states about the nature of the solution to this equation.

share|cite|improve this question
The second question:'s_conjecture – Qiaochu Yuan Oct 3 '10 at 10:37
@Chandru1 : sorry, could you please explain to me that factorization (y+i)(y-i)? I don't know what it means. – Weltschmerz Oct 3 '10 at 13:56
He's saying that integers of the form $y^2+1$ can be represented as a product of two Gaussian integers, $y+i$ and $y-i$, where $i$ is the usual imaginary unit. – J. M. Oct 3 '10 at 15:10
For a totally elementary answer, see . – Kieren MacMillan Nov 9 '14 at 20:54
up vote 7 down vote accepted

Alon Amit's answer is not right, I believe.

$2$ is not prime in the Gaussian integers! $(1+i)$ divides $2$.

The argument upto the fact that the prime $p$ divides $y+i$, $y-i$ and $2i$ is correct.

Since $p|2i$ we consider $p = 1+i$. Now any multiple of $1+i$ is of the form $2x + i2y$ or $2x+1 + i(2y+1)$. Since $y$ is even, $y+i$ cannot be divisible by $1+i$ and thus $y+i$ and $y-i$ are co-prime.

Setting $y+i$ to be a perfect cube (upto units) easily gives us $y=0$ and so $x=1, y=0$ is the only solution.

share|cite|improve this answer

If $x$ is even then $x^3$ is divisible by 4, so $x^3-1 \equiv 3 \pmod 4$ and this cannot be a square. Thus $x$ is odd and $y$ is even.

Now, if a prime $p$ divides both $y+i$ and $y-i$ then it divides their difference $2i$. Thus $p=2$ (up to units), but then $p$ divides $y$. That's impossible since it divides $y+i$ as well.

EDIT: I was too hasty in writing this, as pointed out by Moron. The prime 2 ramifies in $\mathbb{Z}[i]$, and is (up to units) the square of $1+i$. Sorry for the confusion.

share|cite|improve this answer

Is it really necessary to use complex numbers here? Does this sound reasonable to you or is there a flaw? According to the 7-period for n^2 and n^3-1 (mod 7) LHS=RHS requires both to be 0 mod(7), so that for some n and k y^2=n*7^2 must equal k* 7^3 -1 and therefore 7^2(n-7k)=-1 , impossible, since 7^2>1. I note the table format doesn't come out right - you have to do it yourselves.

share|cite|improve this answer
Welcome to MSE! I realize you don't yet have enough reputation, but this is better left as a comment as it is not explicitly answering the question and posing another one. Regards – Amzoti Apr 9 '13 at 12:52
@Mikael Jensen, your reasoning is wrong: it is true that for y^2 and x^3-1 to be equal (mod 7) both must equal 0 (mod 7). This indeed implies that y^2=0 (mod 7) and hence y=0 (mod 7), y=7n and y^2=7^2n^2, but x^3-1=0 (mod 7) does not imply that x^3-1=7^3k^3-1! It implies that x^3=1 (mod 7) and thus x=1,2 or 4 (mod 7). If, for example, x=7k+1, then x^3-1=(7k+1)^3-1 = (7k)^3+3(7k)^2+3(7k), and your argument fails. – Jose Brox Aug 13 '14 at 10:17

Your Answer


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