Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
If a CAS can do it, I guess a hand can do it, although my hands don't have much experience in the matter. Probably you do some kind of descent/ Selmer group calculation?
@pablo I just mean that the CAS can compute whole Mordell-Weil group over of the elliptic curve $\mathbb{Q}$. Apparently the group only has 3 points. To figure out what the torsion looks like by hand, you'd have to do some work, but these techniques are well-known.
Maybe it's worth pointing out that, even if one did not realize it was isomorphic to the Fermat curve, one could discover quickly using a CAS that the elliptic curve has rank 0, and then that the only rational points were the obvious ones (which I guess are 3-torsion points).
@MattF. I thought of the same example (basically) after posting this, but haven't had a chance until now to come and fix the question to avoid this. Take a look at the edit I am about to make.
Thanks for the references! I would accept both answers if I could. I accepted Joe's answer because he spoke to why one can't get better than 1/2 power savings.
Interesting question. I assume you're familiar with work of Smyth, Flammang, etc. on lower bounds for the Mahler measure of totally positive algebraic integers? (These give a lower bound of $C=1.722...$ for $M(\alpha)^{1/d}$ with finitely many exceptions, but valid for all totally positive integers $\alpha$, not just those with all conjugates $>1$).
I'm defining a local minimum of a subset $\Omega$ of $\mathbb{R}^2$ as a point $P$ such that there is an open neighborhood of $P$ containing no points of $\Omega$ having lower $y$-coordinate.