2000 character limit reached
An Elliptic Curve Analogue of Pillai's Lower Bound on Primitive Roots
Published 27 Apr 2021 in math.NT | (2104.13256v2)
Abstract: Let $E/\mathbb{Q}$ be an elliptic curve. For a prime $p$ of good reduction, let $r(E,p)$ be the smallest non-negative integer that gives the $x$-coordinate of a point of maximal order in the group $E(\mathbb{F}_p)$. We prove unconditionally that $r(E,p)> 0.72\log\log p$ for infinitely many $p$, and $r(E,p) > 0.36 \log p$ under the assumption of the Generalized Riemann Hypothesis. This can be viewed as elliptic curve analogues of classical lower bounds on the least primitive root of a prime.
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.