Skip to Main content Skip to Navigation

Solvability by Radicals from an Algorithmic Point of View

Abstract : Any textbook on Galois theory contains a proof that a polynomial equation with solvable Galois group can be solved by radicals. From a practical point of view, we need to find suitable representations of the group and the roots of the polynomial. We first reduce the problem to that of cyclic extensions of prime degree and then work out the radicals, using the work of Girstmair. We give numerical examples of Abelian and non-Abelian solvable equations and apply the general framework to the construction of Hilbert Class fields of imaginary quadratic fields.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:10:54 AM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:11:44 PM


  • HAL Id : inria-00072522, version 1



Guillaume Hanrot, François Morain. Solvability by Radicals from an Algorithmic Point of View. [Research Report] RR-4109, INRIA. 2001. ⟨inria-00072522⟩



Record views


Files downloads