2000 character limit reached
Iteration of Quadratic Polynomials Over Finite Fields
Published 10 Jan 2017 in math.NT | (1701.02707v2)
Abstract: For a finite field of odd cardinality $q$, we show that the sequence of iterates of $aX2+c$, starting at $0$, always recurs after $O(q/\log\log q)$ steps. For $X2+1$ the same is true for any starting value. We suggest that the traditional "Birthday Paradox" model is inappropriate for iterates of $X3+c$, when $q$ is 2 mod 3.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.