Galois theory by calculator

Abstract

We present an algorithm to determine the Galois group of an irreducible monic polynomial f(x) ∈ Z[x] of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given integer a square? and Does a given polynomial have an integral root? Since these are both easily addressed with a calculator, our algorithm amounts to Galois theory by calculator. For example, we have an implementation at Desmos.com. In an appendix we present a simplified version of our algorithm, suitable for a handheld calculator, in case f(x) = xn + px + q.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…