On the representation of integers by binary forms (Q5919621)

Let \(F\) be a binary form with integer coefficients, non-zero discriminant and degree \(d\ge 3\). Denote by \(R_F(Z)\) the number of integers of absolute value at most \(Z\) which are represented by \(F\). There is an extensive literature, going back to the foundational works of Fermat, Lagrange, Legendre, Gauss and Landau concerning the growth of \(R_F(Z)\). \textit{P. Erdős} and \textit{K. Mahler} [J. Lond. Math. Soc. 13, 134--139 (1938; Zbl 0018.34401)] proved that if \(F\) is irreducible then \[ R_F(Z)\geq c_1 Z^{2/d}. \] \textit{C. Hooley} [J. Reine Angew. Math. 226, 30--87 (1967; Zbl 0163.04605)] determined the asymptotic growth rate of \(R_F(Z)\) when \(F\) is an irreducible binary cubic form. In later papers C. Hooley dealt also with the cases when the discriminant is a perfect square, or \(F(x, y) = ax^d +by^d\) with \(d\ge 3\). In the present paper the authors give a general approach and among others prove the following theorem:\par Let \(F\) be a binary form with integer coefficients, non-zero discriminant and degree \(d\ge 3\). Let \(\varepsilon \geq 0\). There exists a positive number \(C_F\) such that \[ R_F(Z)=C_F Z^{2/d}+O_{F,\varepsilon}(Z^{\beta_F+\varepsilon}) \] where \(\beta_F\) is explicitly given.