Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Polynomials (x3n)(x2 + 3) Solvable Modulo Any Integer

Andrea M. Hyde, Paul D. Lee and Blair K. Spearman
The American Mathematical Monthly
Vol. 121, No. 4 (April 2014), pp. 355-358
DOI: 10.4169/amer.math.monthly.121.04.355
Stable URL: http://www.jstor.org/stable/10.4169/amer.math.monthly.121.04.355
Page Count: 4
  • Download ($19.00)
  • Cite this Item
Polynomials (x3 − n)(x2 + 3) Solvable Modulo Any Integer
Preview not available

Abstract

Abstract We give an infinite family of polynomials that are solvable modulo m for every integer m > 1, yet have no roots in the rational numbers. Such polynomials are called intersective. Our classification uses only techniques available in an undergraduate course in number theory.

Page Thumbnails