Solving norm form equations via lattice basis reduction (Q1359135): Difference between revisions

Let \(N\) and \(u\) be positive integers and consider the norm form equation \[ N\left( x \root 4 \of {N^-1} + y \root 4 \of {N^4+1} +z \right)=\pm u (x,y,z\in \mathbb{Z}) \] Using Padé approximation and techniques of \textit{N. I. Feldman} [Math. Notes 8, 674-679 (1970); translation from Mat. Zametki 8, 361-371 (1970; Zbl 0211.37603)] upper bounds are given for the solutions of the equation. Among other results, it is shown that for \(N\geq 20\) all solutions satisfy \[ \max (|x|,|y|,|z|)\leq 10^6 N^{5/2}|u|^{1/67}. \] This inequality is much sharper then the bound one obtains by Baker's method. By using LLL reduction the author proves that for \(u=1\), \(5\leq N\leq 100\) all solutions are given by \((x,y,z)=(0,0,\pm 1),(\pm 1,0,\pm N),(0,\pm 1,\pm N)\).