2009/08/02 by S. A. Belbas, Belbas, S. A.
Computer Science · Mathematics · #History and Theory of Mathematics #Mathematics, Computing, and Information Processing #Polynomial and algebraic computation #math.HO #msc:12A20 #msc:97B40
paper · pdf · doi:10.48550/arxiv.0908.0157
9 pages
arxiv created 2009/08/02 · arxiv updated 2009/12/01
We give two elementary proofs, at a level understandable by students with only pre-calculus knowledge of Algebra, of the well known fact that an irreducible irrational n-th root of a positive rational number cannot be solution of a polynomial of degree less than n with rational coefficients. We also state and prove a few simple consequences.