For any polynomial P(x) ∈ Z[x] , we study arithmetic dynamical systems generated by FP(n)=∏k≤nP(k)(modp),n≥ 1. We apply this to improve the lower bound on the number of distinct quadratic fields of the form Q(FP(n)) in short intervals M≤ n≤ M+ H previously due to Cilleruelo, Luca, Quirós and Shparlinski. As a second application, we estimate the average number of missing values of FP(n)(modp) for special families of polynomials, generalizing previous work of Banks, Garaev, Luca, Schinzel, Shparlinski and others.
- Diophantine equations
- Distribution of sequences modulo p
- Dynamical system modulo p
- Perfect powers
- Prime ideals of number fields
ASJC Scopus subject areas