Primitive prime divisors in the forward orbit of a polynomial
Abstract
For the polynomial f(z) ∈ Q[z], we consider the Zsigmondy set Z(f,0) associated to the numerators of the sequence \fn(0)\n ≥ 0. In this paper, we provide an upper bound on the largest element of Z(f, 0). As an application, we show that the largest element of the set Z(f,0) is bounded above by 6 when f(z) = zd + ze +c ∈ Q[z], with d>e ≥ 2 and |c|>2. Furthermore, when f(z) =zd+c ∈ Q[z] with |f(0)| > 2dd-1 and d >2, we also deduce a result of Krieger [Int. Math. Res. Not. IMRN, 23 (2013), pp. 5498-5525] as a consequence of our main result.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.