Primitive prime divisors in zero orbits of polynomials

Abstract

Let (bn) = (b1, b2, ...) be a sequence of integers. A primitive prime divisor of a term bk is a prime which divides bk but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial f(z) is a sequence of integers (cn) where the n-th term is the n-th iterate of f at 0. We consider primitive prime divisors of zero orbits of polynomials. In this note, we show that for integers c and d, where d > 1 and c ≠ 1, every iterate in the zero orbit of f(z) = zd + c contains a primitive prime whenever zero has an infinite orbit. If c = 1, then every iterate after the first contains a primitive prime.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…