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

  title={Why Eisenstein Proved the Eisenstein Criterion and Why Sch{\"o}nemann Discovered It First},
  author={David A. Cox},
  journal={The American Mathematical Monthly},
  pages={21 - 3}
  • David A. Cox
  • Published 1 January 2011
  • Mathematics
  • The American Mathematical Monthly
Abstract This article explores the history of the Eisenstein irreducibility criterion and explains how Theodor Schönemann discovered this criterion before Eisenstein. Both were inspired by Gauss's Disquisitiones Arithmeticae, though they took very different routes to their discoveries. The article will discuss a variety of topics from 19th-century number theory, including Gauss's lemma, finite fields, the lemniscate, elliptic integrals, abelian groups, the Gaussian integers, and Hensel's lemma. 
A Generalization of the Eisenstein–Dumas–Schönemann Irreducibility Criterion
Abstract In 2013, Weintraub gave a generalization of the classical Eisenstein irreducibility criterion in an attempt to correct a false claim made by Eisenstein. Using a different approach, we prove
A mild generalization of Eisenstein’s criterion
We state and prove a mild generalization of Eisenstein’s Criterion for a polynomial to be irreducible, correcting an error that Eisenstein made himself. Eisenstein originally stated and proved the
Schönemann–Eisenstein–Dumas-Type Irreducibility Conditions that Use Arbitrarily Many Prime Numbers
The famous irreducibility criteria of Schönemann–Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper, we will use
Gauss’ lemma and valuation theory
Abstract Gauss’ lemma is not only critically important in showing that polynomial rings over unique factorization domains retain unique factorization; it unifies valuation theory. It figures
On the Number of Primes for Which a Polynomial is Eisenstein
Previously Heyman and Shparlinski gave an asymptotic formula with error term for the number of Eisenstein polynomials of fixed degree and bounded height. Let $\psi(f)$ denote the number of primes for
Several Proofs of the Irreducibility of the Cyclotomic Polynomials
A number of classical proofs of the irreducibility of the nth cyclotomic polynomial ϕn(x), in both the original and a simplified form are presented.
Eisenstein’s criterion, Fermat’s last theorem, and a conjecture on powerful numbers
Given integers $\ell > m >0$, we define monic polynomials $X_n$, $Y_n$, and $Z_n$ with the property that $\mu$ is a zero of $X_n$ if and only if the triple $(\mu,\mu+m,\mu+\ell)$ satisfies $x^n + y^n
On shifted Eisenstein polynomials
An upper bound is determined on the maximum shift that is needed given a shifted Eisenstein polynomial and a lower bound on the density is provided, which is strictly greater than the density of classical EisensteinPolynomials.
On the number of Eisenstein polynomials of bounded height
A more precise version of an asymptotic formula of A. Dubickas for the number of monic Eisenstein polynomials of fixed degree d and of height at most H, as Harrow \infty, which gives an explicit bound for the error term.
Geometric constructibility of cyclic polygons and a limit theorem
We study convex cyclic polygons, that is, inscribed $n$-gons. Starting from P. Schreiber's idea, published in 1993, we prove that these polygons are not constructible from their side lengths with


Abel's Theorem on the Lemniscate
Introduction. As is well known, one of the great accomplishments of Gauss's youth was the proof that a regular polygon of 17 sides could be constructed with ruler and compass. In the seventh chapter
History of the Theory of Numbers
THE arithmetical questions treated by Diophantus of Alexandria, who flourished about the year 250 A.D., included such problems as the solution of the equationsHistory of the Theory of Numbers.By
History of the Theory of Numbers
THE third and concluding volume of Prof. Dickson's great work deals first with the arithmetical. theory of binary quadratic forms. A long chapter on the class-number is contributed by Mr. G. H.
As was his custom, Fermat did not give proofs of these statements, but a century later, Euler used Fermat’s method of descent to give the first rigorous proofs of these three results (in 1750, 1774,
Rational Reciprocity Laws
Rational reciprocity deals with residue symbols which assume only the values ±1 and which have entries in ℤ; the first rational reciprocity laws other than quadratic reciprocity were discovered by
Rational Points on Elliptic Curves
The theory of elliptic curves involves a pleasing blend of algebra, geometry, analysis, and number theory. This volume stresses this interplay as it develops the basic theory, thereby providing an
Galois Theory
Remark 0.1 (Notation). |G| denotes the order of a finite group G. [E : F ] denotes the degree of a field extension E/F. We write H ≤ G to mean that H is a subgroup of G, and N G to mean that N is a
The Arithmetic-Geometric Mean of Gauss
The arithmetic-geometric mean of two numbers a and b is defined to be the common limit of the two sequences , and , determined by the algorithm (0.1) . Note that a 1 and b 1 are the
Primes of the form x2 + ny2
Mathematische Werke
VERSATILITY is the most delusive of the fairy gifts ; the men of genius on whom it was bestowed otherwise than in subtle malevolence can be counted on the fingers. In the age of Euler himself, Johann