# Integers $h$ such that $xy(x+y) = h$ has many integer solutions

In the following paper (http://www.ams.org/journals/jams/1991-04-04/S0894-0347-1991-1119199-X/), C.L. Stewart showed that there exist infinitely many integers $h$ such that the equation

(1) \begin{equation} xy(x+y) = h \end{equation}

has at least 18 solutions in co-prime integers $x$ and $y$. In the same paper, he also conjectured (his conjecture covers far more) that there exists positive numbers $r,c$ such that for all integers $h$ with $|h| \geq r$, the equation (1) has at most $c$ solutions in co-prime integers $x$ and $y$.

My question is, is it reasonable to conjecture that one may take $c = 18$? That is, does there exist infinitely many $h$ for which (1) has at least 19 solutions in co-prime integers $x$ and $y$?

• You probably already know this, but letting $E_h$ be the elliptic curve (1), there is a bound $$\#\text{(coprime integer solutions)}\le C^{1+\text{rank }E_h(\mathbb Q)}$$ for an absolute constant $C$. So if the current conjecture that elliptic curve ranks are bounded is true, then Stewart's conjecture would follow. – Joe Silverman Jan 10 '18 at 1:12
• Also that if you drop the coprimality condition then the number of solutions is unbounded. – Noam D. Elkies Jan 11 '18 at 2:30
• @NoamD.Elkies As Noam says, without the gcd condition, the number is unbounded, but I believe that it is not known if for all $\epsilon>0$, the number of solutions can be greater than $O_\epsilon(|h|^{1-\epsilon})$ for infinitely many $h$. This seems to be a very interesting, and also very difficult, problem. – Joe Silverman Jan 11 '18 at 4:31
• Do you mean $O_\epsilon(\log|h|)^{1-\epsilon}$? – Noam D. Elkies Jan 11 '18 at 4:36
• (That's what one would get from elliptic curves of unbounded rank in this family.) – Noam D. Elkies Jan 11 '18 at 4:52

There seem to be lots of $h$ which have $20$ solutions. Among squarefree $47$-smooth numbers I found $$101623830, 363993630, 455885430, 1418488890, 15427730010, 31983962010, 322640788470, 1087394017710, 11406069164490, 304250263527210$$ with $20$ solutions and $903210$ and $23730036330$ with $24$.
EDIT: Oops: my program was counting only solutions with $x > 0$ (but $y$ of any sign). Those numbers $101623830, \ldots, 304250263527210$ actually have $30$ solutions each, and $903210$ and $23730036330$ have $36$.
• Yes, the number of solutions should be a multiple of 6 since whenever $(x,y)$ is a solution then so are $(y,x), (y, - x - y), (-x-y, x), (-x-y, y), (x,-x-y)$, and these should typically be co-prime whenever $(x,y)$ are co-prime with only finitely many exceptions. – Stanley Yao Xiao Jan 12 '18 at 10:35