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.

 

A generalization of Swan’s theorem
HTML articles powered by AMS MathViewer

by Harold M. Fredricksen, Alfred W. Hales and Melvin M. Sweet PDF
Math. Comp. 46 (1986), 321-331 Request permission

Abstract:

Let f and g denote polynomials over the two-element field. In this paper we show that the parity of the number of irreducible factors of ${x^n}f + g$ is a periodic function of n, with period dividing eight times the period of the polynomial ${f^2}(x(g/f)’- n(g/f))$. This can be considered a generalization of Swan’s trinomial theorem [3].
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11T06
  • Retrieve articles in all journals with MSC: 11T06
Additional Information
  • © Copyright 1986 American Mathematical Society
  • Journal: Math. Comp. 46 (1986), 321-331
  • MSC: Primary 11T06
  • DOI: https://doi.org/10.1090/S0025-5718-1986-0815852-1
  • MathSciNet review: 815852