Papers
Topics
Authors
Recent
Search
2000 character limit reached

Orders of reductions of elliptic curves with many and few prime factors

Published 7 Nov 2015 in math.NT | (1511.02388v1)

Abstract: In this paper, we investigate extreme values of $\omega(E(\mathbb{F}_p))$, where $E/\mathbb{Q}$ is an elliptic curve with complex multiplication and $\omega$ is the number-of-distinct-prime-divisors function. For fixed $\gamma > 1$, we prove that [ #{p \leq x : \omega(E(\mathbb{F}_p)) > \gamma\log\log x} = \frac{x}{(\log x){2 + \gamma\log\gamma - \gamma + o(1)}}. ] The same result holds for the quantity $#{p \leq x : \omega(E(\mathbb{F}_p)) < \gamma\log\log x}$ when $0 < \gamma < 1$. The argument is worked out in detail for the curve $E : y2 = x3 - x$, and we discuss how the method can be adapted for other CM elliptic curves.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.