A divisor problem for polynomials
From MaRDI portal
Abstract: We characterize all monic polynomials that have the property that [f(p) mid f(p^{p}),~ ext{for all sufficiently large primes }p geq N(f). ] We also give necessary conditions and a sufficient condition for monic polynomials to satisfy for all primes .
Recommendations
Cites work
- Chebotarëv and his density theorem
- scientific article; zbMATH DE number 2186169 (Why is no real title available?)
- scientific article; zbMATH DE number 1995865 (Why is no real title available?)
- On the greatest prime factor of \((n^2)+1\)
- Prime values of polynomials and irreducibility testing
- Resultants of cyclotomic polynomials
- Smooth values of polynomials
- The largest prime factor of X^3+2
- The largest prime factor of X3+2
Cited in
(10)- Subgroup avoidance for primes dividing the values of a polynomial
- Smooth divisors of polynomials
- Divisibility of Polynomial Expressions
- A problem concerning cyclotomic polynomials
- The Fixed Divisor of a Polynomial
- scientific article; zbMATH DE number 90587 (Why is no real title available?)
- A Divisor Problem for Values of Polynomials
- A note on prime divisors of polynomials P(T^k), k 1
- On Polynomials and Divisibility
- A question of divisibility of an analytic germ by a polynomial
This page was built for publication: A divisor problem for polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030084)