On the equation Np1(E)· Np2(E)·s Npk(E)=n

Abstract

For a given elliptic curve E/Q, let Np(E) be the number of points on E modulo p for a prime of good reduction for E. Given integer n, let Gk(E,n) be the number of k-tuples of p1<p2<… <pk primes of good reduction for E, for which the equation in the title holds, then on assuming the Generalized Riemann Hypothesis for elliptic curves without CM (and unconditionally if the curves have complex multiplication), I show that n∞ Gk(E,n)=∞ for any integer k≥ 3. I conjecture that this result also holds for k=1,2 i.e. this conjecture says that there are arbitrarily long ``elliptic progressions of primes'' i.e. sequences of primes p1<p2<·s <pm of arbitrary lengths m such that Np1(E)=Np2(E)=·s =Npm(E).

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…