Primes dividing values of a given Polynomial

From MaRDI portal



Abstract: Let P(x)inmathbbZ[x] be a polynomial. We give an easy and new proof of the fact that the set of primes p such that pmidP(n), for some ninmathbbZ, is infinite. We also get analog of this result for some special domains.












This page was built for publication: Primes dividing values of a given Polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6389944)