Polynomial products modulo primes and applications

From MaRDI portal
Publication:2297587




Abstract: For any polynomial P(x)inmathbbZ[x], we study arithmetic dynamical systems generated by displaystyleFP(n)=prodklenP(n)(extmodp), nge1. We apply this to improve the lower bound on the number of distinct quadratic fields of the form mathbbQ(sqrtFP(n)) in short intervals MlenleM+H previously due to Cilleruelo, Luca, Quir'{o}s and Shparlinski. As a second application, we estimate the average number of missing values of FP(n)(extmodp) for special families of polynomials, generalizing previous work of Banks, Garaev, Luca, Schinzel, Shparlinski and others.



Cites work







This page was built for publication: Polynomial products modulo primes and applications

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