On unsolvable equations of prime degree
classification
🧮 math.NT
math.HO
keywords
proofweberdegreeequationserrorkroneckerprimesolvable
read the original abstract
Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by radicals. A relatively elementary proof without using the full power of Galois theory is due to Weber. We give a rather short proof of Kronecker's theorem with a slightly different argument from Weber's. Several modern presentations of Weber's proof contain inaccuracies, which can be traced back to an error in the original proof. We discuss this error and how it can be corrected.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.