arXiv subjects
Publications and source records attributed to Michael A. Bennett.
We exactly determine the integral solutions to a previously untreated infinite family of cubic Thue equations of the form $F(x,y)=1$ with at least $5$ such solutions. Our approach combines elementary arguments, with lower bounds for linear forms in logarithms and lattice-basis reduction.
The Diophantine equation (x^n-1)/(x-1)=y^q has four known solutions in integers x, y, q and n with |x|, |y|, q > 1 and n > 2. Whilst we expect that there are, in fact, no more solutions, such a result is well beyond current technology. In this paper, we prove that if (x,y,n,q) is a solution to this equation, then n has three or fewer prime divisors, counted with multiplicity. This improves a result of Bugeaud and Mihailescu.
We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower bounds for linear forms in logarithms in conjunction with lattice-basis reduction.
We give a light-hearted look at the topic in the title. Most solutions are in semi-boring parametric families, but some are sporadic and come from Thue equations. One amusing example is m = 2, x = (4/5)^128, y = (4/5)^125.