$x^3+48=y^4$ does not have integer (?) solutions How does one find all positive integer solutions to the equation $x^3+48=y^4$?
 A: One way would be to note that a solution of this equation would also give a solution of the equation $x^3 + 48 = y^2$. That's an elliptic curve of rank 1 and with trivial torsion subgroup. There are bounds on the heights of the integral points on a Weierstrass model of an elliptic curve in terms of the coefficients. You can find a generator for the Mordell-Weil group and using the height bounds find all the integral points. In this case, the only point will be $(x,y) = (1,7)$. Since 7 is not a square, you deduce that the original equation has no integral solutions. Of course, I didn't actually compute the bounds, but asked Magma, which does it automatically. Here is the code:
> P<x>:=PolynomialRing(Integers());
> E:=EllipticCurve(x^3 + 48);
> Rank(E);
1
> TorsionSubgroup(E);
Abelian Group of order 1
> IntegralPoints(E);
[ (1 : 7 : 1) ]
[ <(1 : 7 : 1), 1> ]

A: I realize this is a massive revive, but here is a solution without any powerful theorems about elliptic curves.
We have $x^3 + 64 = y^4 + 2^4$. It is easy to show all (odd) primes dividing the RHS are $1 \pmod{8}$. Now, looking modulo $16$ we deduce either $x \equiv 1 \pmod{16}$ and $y$ is odd or $x,y$ are both even. For the second case if $v_2(x) = 1$ we derive a contradiction because $v_2(LHS) = 3$ while $v_2(RHS) \ge 4$. If $v_2(x) \ge 2$ we have $v_2(LHS) \ge 6$. Thus we must have $v_2(y) = 1$ for $v_2(y^4 + 16) > 4$. Writing $y = 2k$ we need $v_2(k^4 + 1) \ge 2$. But this is absurd since $v_2(k^4 + 1) \le 1$ by checking modulo $4$. Thus it follows $x \equiv 1 \pmod{16}$.
But now utilize $x^3 + 64 = (x+4)(x^2 - 4x + 16)$. $x+4$ is $5 \pmod{8}$, which is absurd so we are done.
A: I'm posting this as a community wiki "answer" because I'm not sure it works and the explanation wouldn't show up very well in the comments section I guess. If we factor the equation in $\mathbb{Z}[\sqrt{3}]$ we get $(y^2 - 4\sqrt{3})(y^2 + 4\sqrt{3}) = x^3$. Thus if $y^2 - 4 \sqrt{3} = (a + b\sqrt{3})^3$ for some $a + b\sqrt{3} \in \mathbb{Z}[\sqrt{3}]$ then we get
$$y^2 - 4 \sqrt{3} = a^3 + 3a^2b\sqrt{3} + 9ab^2 + 3b^3 \sqrt{3} $$
so that we must have $3a^2 b + 3b^3 = -4$ and since $3$ does not divide $4$ we get a contradiction. The problem is that I need to justify somehow that $y^2 - 4 \sqrt{3} = (a + b\sqrt{3})^3$ and although I know that $\mathbb{Z}[\sqrt{3}]$ is a unique factorization domain, I would need the two factors $y^2 - 4 \sqrt{3}$ and $y^2 + 4 \sqrt{3}$ to be coprime I think, and I can't seem to justify it or disprove it.
Edit (Alex):
Suppose that we have an integer solution to $x^3 = y^4 - 48$.
Claim: The two factors $y^2\pm 4\sqrt{3}$ are coprime in $\mathbb{Z}[\sqrt{3}]$. Indeed, let $\alpha = v+\sqrt{3}w$ divide both factors. Then, $\alpha$ also divides their difference, which is $8\sqrt{3}$. Without loss of generality assume that $\alpha$ is irreducible. Then, $\alpha$ divides 2 or is (up to a unit) equal to $\sqrt{3}$. Since $\alpha$ also divides $x^3\in \mathbb{Z}$, we deduce that $x^3$ is divisible by either 2 or 3 (or both). This implies that $y$ must also be divisible by either 2 or 3. But then, $x^3$ is also divisible by either 8 or 27 (or both), since it is a cube, and $y^4$ is divisible by 16 or 81. Now, the latter is impossible, since $y^4 - 48 \equiv -3\neq 0\pmod{9}$. The former is also impossible, since it would imply that $x^3=y^4 - 48$ is divisible by 16, so $x$ is divisible by 4, so $x^3$ is divisible by 64 and you would obtain a contradiction modulo 64 as above.
This implies that $y^2+4\sqrt{3}$ is a cube times a unit in $\mathbb{Z}[\sqrt{3}]$, $y^2+4\sqrt{3}=u\cdot(a+\sqrt{3}b)^3$. The units in this ring form an abelian group with torsion $\pm 1$ and with free part of rank one, generated by $2+\sqrt{3}$. The torsion are all cubes, so we can incorporate them into the bracket. Of course, cubes of a non-torsion unit can also be incorporated into the bracket, so it suffices to show that $y^2+4\sqrt{3}\neq (2+\sqrt{3})^{\delta}\cdot(a+\sqrt{3}b)^3$ for $\delta\in{0,1,2}$. This is done through case by case analysis, Adrián has already done the $\delta=0$ case.
