Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Solving solvable quintics
HTML articles powered by AMS MathViewer

by D. S. Dummit PDF
Math. Comp. 57 (1991), 387-401 Request permission

Corrigendum: Math. Comp. 59 (1992), 309.
Corrigendum: Math. Comp. 59 (1992), 309.

Abstract:

Let $f(x) = {x^5} + p{x^3} + q{x^2} + rx + s$ be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if and only if $f(x)$ is solvable by radicals (i.e., when its Galois group is contained in the Frobenius group ${F_{20}}$ of order 20 in the symmetric group ${S_5}$). When $f(x)$ is solvable by radicals, formulas for the roots are given in terms of p, q, r, s which produce the roots in a cyclic order.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 12E12, 12F10
  • Retrieve articles in all journals with MSC: 12E12, 12F10
Additional Information
  • © Copyright 1991 American Mathematical Society
  • Journal: Math. Comp. 57 (1991), 387-401
  • MSC: Primary 12E12; Secondary 12F10
  • DOI: https://doi.org/10.1090/S0025-5718-1991-1079014-X
  • MathSciNet review: 1079014