On the number of Eisenstein polynomials of bounded height (Q360188)

An integer polynomial \(a_dx^d+\dots+a_1x+a_0\) of degree \(d \geq 2\) is called an \textit{Eisenstein polynomial} if there is a prime number \(p\) that divides \(a_0,a_1,\dots,a_{d-1}\), but not \(a_d\), and \(a_0\) is not divisible by \(p^2\). Let \(E_d(H)\) (resp. \(F_d(H)\)) be the number of monic (resp. arbitrary) Eisenstein polynomials of degree \(d\) and height at most \(H\). In [Appl. Algebra Eng. Commun. Comput. 14, No. 2, 127--132 (2003; Zbl 1045.11019)] the reviewer showed that, as \(H \to \infty\), the asymptotic formula \(E_d(H) \sim \alpha_d (2H)^d\) holds with the constant \[ \alpha_d:=1-\prod_{p} (1-(p-1)p^{-d-1}), \] where the product is taken over all primes \(p\). In this paper, the authors show that this formula holds with the error term \(O(H^{d-1})\) if \(d \geq 3\) and \(O(H (\log H)^2)\) if \(d=2\). They also show that, as \(H \to \infty\), we have \[ F_d(H)=\beta_d (2H)^{d+1}+O(H^d) \] for \(d \geq 3\) and \(F_2(H)=\beta_2 (2H)^3 O((H \log H)^2)\) with \[ \beta_d:=1-\prod_{p} (1-(p-1)^2 p^{-d-2}). \] The proof uses some analytic number theory and the inclusion-exclusion principle.