Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First

DOI10.4169/amer.math.monthly.118.01.003zbMath1225.11002OpenAlexW2400983519WikidataQ55898610 ScholiaQ55898610MaRDI QIDQ3072547

David A. Cox

Publication date: 4 February 2011

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4169/amer.math.monthly.118.01.003

zbMATH Keywords

irreducibilitycyclotomic polynomialHensel's LemmaGaussEisensteinSchoenemann

Mathematics Subject Classification ID

History of mathematics in the 18th century (01A50) Polynomials in number theory (11C08) History of number theory (11-03) History of mathematics in the 19th century (01A55) History in mathematics education (97A30) Elementary algebra (educational aspects) (97H20)

Related Items

On the number of Eisenstein polynomials of bounded height ⋮ A Generalization of the Eisenstein–Dumas–Schönemann Irreducibility Criterion ⋮ Methodologies of Symbolic Computation ⋮ Geometric constructibility of cyclic polygons and a limit theorem ⋮ On the number of primes for which a polynomial is Eisenstein ⋮ Unnamed Item ⋮ On shifted Eisenstein polynomials ⋮ Gauss’ lemma and valuation theory ⋮ A new class of irreducible polynomials ⋮ Schönemann–Eisenstein–Dumas-Type Irreducibility Conditions that Use Arbitrarily Many Prime Numbers ⋮ REMARKS ON A GOLDBACH PROPERTY