On the resolution of \(F(x,y)=G(x,y)\) (Q1314438)

The author proposes a method for the fast determination of all integral pairs \((x,y)\) with \(\max (| x |,| y |)\) less than a prescribed large bound, such that \[ | F(x,y) | \leq | G(x,y) |;\tag{*} \] here \(F(x,y) \in \mathbb Z[x,y]\) is a form of degree \(n\), irreducible over \(\mathbb Q[x,y]\) and \(G(x,y) \in \mathbb Z[x,y]\) is any polynomial of degree \(m \leq n-3\). In 1987 \textit{A. Pethő} [J. Symb. Comput. 4, 103--109 (1987; Zbl 0625.10011)] treated this problem in the special case that \(G\) is a constant. The present author observes that Pethő's ideas can be applied also in the case of (*). Both authors approach their computational problem via continued fractions: Legendre's theorem, of course, and a Legendre-type theorem by \textit{R. T. Worley} [J. Aust. Math. Soc., Ser. A 31, 202--206 (1981; Zbl 0465.10026)]. In this paper, two simple lemmas are proved, which make the application of Worley's result more effective. As an application of his method, the author solves \[ | x^ 5-xy^ 4-y^ 5 | \leq 200(x^ 2+y^ 2) \] in integers \(x,y\) with \(\max (| x |,| y |) \leq 10^{500}\).