Polynomials with roots modulo every integer

Daniel Berend, Yuri Bilu

Proceedings of the American Mathematical Society · 1996 · 54 citations · 13 references

DOIFull text

Open access

Concepts

Abstract

Given a polynomial with integer coefficients, we calculate the density of the set of primes modulo which the polynomial has a root. We also give a simple criterion to decide whether or not the polynomial has a root modulo every non-zero integer.

References

13