Prime Numbers and Irreducible Polynomials

@article{Murty2002PrimeNA,
  title={Prime Numbers and Irreducible Polynomials},
  author={M. Ram Murty},
  journal={The American Mathematical Monthly},
  year={2002},
  volume={109},
  pages={452-458}
}
The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry. There are certain conjectures indicating that the connection goes well beyond analogy. For example, there is a famous conjecture of Buniakowski formulated in 1854 (see Lang [3, p. 323]), independently reformulated by Schinzel, to the effect that any irreducible polynomial f (x) in Z[x] such that the set of values f (Z+) has no common divisor… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

Irreducibility criteria for polynomials with non-negative coefficients

  • M. Filaseta
  • Canadian J. Math
  • 1988
1 Excerpt

Some irreducible polynomials which are reducible mod p for all

  • M. A. Lee
  • p, Amer Math. Monthly
  • 1969
2 Excerpts

Similar Papers

Loading similar papers…