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.

 

Splitting of quartic polynomials
HTML articles powered by AMS MathViewer

by William W. Adams PDF
Math. Comp. 43 (1984), 329-343 Request permission

Abstract:

For integers r, s, t, u define the recursion $A(n + 4) = rA(n + 3) - sA(n + 2) + tA(n + 1) - uA(n)$ where the initial conditions are set up in such a way that $A(n) = {\alpha ^n} + {\beta ^n} + {\gamma ^n} + {\delta ^n}$ where $\alpha ,\beta ,\gamma ,\delta$ are the roots of the associated polynomial $f(x) = {x^4} - r{x^3} + s{x^2} - tx + u$ In this paper a detailed deterministic procedure using the $A(n)$ for finding how $f(x)$ splits modulo a prime integer p is given. This gives for p not dividing the discriminant of $f(x)$ the splitting of p in the field obtained by adjoining a root of $f(x)$ to the rational numbers. There is an interesting connection between the results here for reciprocal polynomials and some work of D. Shanks.
References
Similar Articles
Additional Information
  • © Copyright 1984 American Mathematical Society
  • Journal: Math. Comp. 43 (1984), 329-343
  • MSC: Primary 12E10; Secondary 11R09, 11R27
  • DOI: https://doi.org/10.1090/S0025-5718-1984-0744941-3
  • MathSciNet review: 744941