Distribution of solutions of diophantine equations \(f_ 1(x_ 1)f_ 2(x_ 2)=f_ 3(x_ 3)\), where \(f_ i\) are polynomials (Q1199652): Difference between revisions

Let \(f_ i\) denote polynomials with integral coefficients of degree \(d_ i\), discriminant \(\Delta_ i\) and leading coefficient \(a_ i\), \(i=1,2,3\). Let \(x>0\) and denote \(N(x)\) the number of solutions \(x_ 1,x_ 2,x_ 3\in \mathbb{Z}\), such that \(| x_ 3|\leq x\) of the diophantine equation \(f_ 3(x_ 3)=f_ 1(x_ 1)f_ 2(x_ 2)\). The purpose of this paper is the examination of the function \(N(x)\). The main result is as follows: If \(\Delta_ 3\neq 0\), then for all \(\varepsilon>0\), \(N(\varepsilon)\ll x^{c+\varepsilon}\), where \[ c=\max\left\{{d_ 3\over d_ 1+d_ 2},{1\over d_ 1}+{1\over d_ 2}-{1\over d_ 1d_ 2},\min\left\{{1\over 2},{(d_ 1,d_ 3)\over d_ 1}\right\},\min\left\{{1\over 2},{(d_ 2,d_ 3\over d_ 2}\right\}\right\}. \] For quadratic polynomials the authors are able to strengthen this result and prove a lower bound which is almost best possible.