Publication | Open Access
Polynomials with roots modulo every integer
54
Citations
13
References
1996
Year
Simple CriterionComputational Number TheoryAnalytic Number TheoryModulus ProblemDiscrete MathematicsDiophantine AnalysisInteger CoefficientsRoot Modulo
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1