Heyman, Randell

On the number of polynomials of bounded height that satisfy the Dumas criterion

J. Integer Seq. 17(2), Article 14.2.4, 7 p., electronic only (2014)

Summary

Summary: We study integer coefficient polynomials of fixed degree and maximum height $H$ that are irreducible by the Dumas criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials as $H \to \infty $. We also show that, for a fixed degree, the density of Dumas polynomials in the set of all irreducible integer coefficient polynomials is strictly less than 1.

Mathematics Subject Classification

11R09

Keywords/Phrases

irreducible polynomial, dumas criterion, coprimality

Downloads