2020/03/22 by Chim, Kwok Chi, Luca, Florian
#11B39 #11D45 #11G05 #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.2003.09951
Let q be a perfect power of a prime number p and E(\mathbb Fq) be an elliptic curve over \mathbb Fq given by the equation y2=x3+Ax+B. For a positive integer n we denote by # E(\mathbb Fqn) the number of rational points on E (including infinity) over the extension \mathbb Fqn. Under a mild technical condition, we show that the sequence \lbrace # E(\mathbb Fqn) \rbracen>0 contains at most 10200 perfect squares. If the mild condition is not satisfied, then #E(\mathbb Fqn) is a perfect square for infinitely many n including all the multiples of 24. Our proof uses a quantitative version of the Subspace Theorem. We also find all the perfect squares for all such sequences in the range q < 50 and n≤ 1000.