Iteration of Polynomials AXd+C Over Finite Fields

Abstract

For a polynomial f(X)=AXd+C ∈ Fp[X] with A≠ 0 and d≥ 2, we prove that if d\;|\;p-1 and fi(0)≠ fj(0) for 0≤ i<j≤ N, then \#fN(Fp) 2p(d-1)N, where fN is the N-th iteration of f.

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…