no. 3 · Tuesday 27 October 2026
Arbitrarily Many Primitive Prime Divisors in an Iterate of $x^d+c$
Abstract
Let $K$ be a number field with ring of integers $R$, let $f_{d,c}(x)=x^d+c\in K[x]$ be a unicritical polynomial of degree $d\ge2$, and let $\varrho_d(n,c)$ denote the number of primitive prime divisors of $f_{d,c}^n(0)$, the $n$-th term of the critical orbit of $f_{d,c}$. We show that $\varrho_d(n,c)$ admits no uniform bound, that is, no bound depending only on $d$ and $n$. More precisely, for all $n\ge1$ and $t\ge1$ there is $c\in R$ for which $f_{d,c}^n(0)$ has at least $t$ primitive prime divisors, and these primes may be prescribed to occur with any given multiplicities. This can be done simultaneously for any finite set of iterates. The construction rests on a density computation. Namely, the set of primes occurring as a primitive prime divisor of $f_{d,c}^n(0)$ for some $c$ has positive density. We compute that density explicitly for $d=2$ over $\mathbb{Q}$, under a hypothesis on the Galois group of the associated Gleason polynomial, verified for $n\le16$. As an application, we produce, for every $m\ge1$, a parameter $c\in R$ (in fact, a whole residue class of them), for which the splitting field of $f_{d,c}^m(x)$ has the maximal possible degree over $K$.
- fields
- Number Theory, Dynamical Systems