You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
A Generalization of Swan's Theorem
Harold M. Fredricksen, Alfred W. Hales and Melvin M. Sweet
Mathematics of Computation
Vol. 46, No. 173 (Jan., 1986), pp. 321-331
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2008235
Page Count: 11
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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^nf + 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 .
Mathematics of Computation © 1986 American Mathematical Society