Note On Elliptic Primitive Points

TL;DR

This paper investigates the distribution of primes for which a point of infinite order on an elliptic curve generates the entire group over finite fields, establishing a lower bound on their density.

Contribution

It proves a lower bound on the number of such primes, advancing understanding of elliptic primitive points and their distribution.

Findings

Established a lower bound  x/  x on the count of primes with primitive points.

Provides insight into the density (E,P) of primes with primitive points on elliptic curves.

Contributes to the theory of elliptic curves and prime distributions in number theory.

Abstract

Let $E$ be an elliptic curve of rank $\text{rk}(E) \geq 1$, and let $P \in E(\mathbb{Q})$ be a point of infinite order. The number of elliptic primes $p \leq x$ for which $\langle P\rangle=E(\mathbb{F}_p)$ is expected to be $\pi(x,E,P)=\delta(E,P)x/\log x+o(x/\log x)$, where $\delta(E,P)\geq 0$ is a constant. This note proves the lower bound $\pi(x,E,P) \gg x/\log x$.

Tables

Table 1. Table 1: Prime Orders n = # ​ E ​ ( 𝔽 p ) 𝑛 # 𝐸 subscript 𝔽 𝑝 n=\#E(\mathbb{F}_{p}) modulo p 𝑝 p for y 2 = x 3 + 2 superscript 𝑦 2 superscript 𝑥 3 2 y^{2}=x^{3}+2 .

$p$	3	13	19	61	67	73	139	163	211	331
$n$	3	19	13	61	73	81	163	139	199	331
$p$	349	541	547	571	613	661	757	829	877
$n$	313	571	571	541	661	613	787	823	937

Table 2. Table 2: Prime Orders n = # ​ E ​ ( 𝔽 p ) 𝑛 # 𝐸 subscript 𝔽 𝑝 n=\#E(\mathbb{F}_{p}) modulo p 𝑝 p for y 2 = x 3 + 6 ​ x − 2 superscript 𝑦 2 superscript 𝑥 3 6 𝑥 2 y^{2}=x^{3}+6x-2 .

$p$	3	7	97	103	181	271	313	367	409	487
$n$	3	7	97	107	163	293	331	383	397	499
$p$	883	967
$n$	853	941

Table 3. Table 3: Prime Orders n / 4 = # ​ E ​ ( 𝔽 p ) / 4 𝑛 4 # 𝐸 subscript 𝔽 𝑝 4 n/4=\#E(\mathbb{F}_{p})/4 modulo p 𝑝 p for y 2 = x 3 − x superscript 𝑦 2 superscript 𝑥 3 𝑥 y^{2}=x^{3}-x .

$p$	5	7	11	19	43	67	163	211	283	331
$n$	2	2	3	5	11	17	41	53	71	83
$p$	523	547	691	787	907
$n$	131	137	173	197	227

Table 4. Table 4: Prime Orders n / 8 = # ​ E ​ ( 𝔽 p ) / 8 𝑛 8 # 𝐸 subscript 𝔽 𝑝 8 n/8=\#E(\mathbb{F}_{p})/8 modulo p 𝑝 p for y 2 = x 3 − x superscript 𝑦 2 superscript 𝑥 3 𝑥 y^{2}=x^{3}-x .

$p$	17	23	29	37	53	101	103	109	149	151
$n$	2	3	5	5	5	13	13	13	17	19
$p$	157	277	293	317	389	487	541	631	661	701
$n$	17	37	37	41	37	53	61	73	79	89
$p$	757	773	797	821	823	829	853
$n$	97	101	97	109	103	97	101

Table 5. Table 5: Prime Orders n / 12 = # ​ E ​ ( 𝔽 p ) / 12 𝑛 12 # 𝐸 subscript 𝔽 𝑝 12 n/12=\#E(\mathbb{F}_{p})/12 modulo p 𝑝 p for y 2 = x 3 + 1 superscript 𝑦 2 superscript 𝑥 3 1 y^{2}=x^{3}+1 .

$p$	31	43	59	67	73	79	97	103	131	139
$n$	3	3	5	7	7	7	7	7	11	13
$p$	151	163	181	199	227	241	337	367	379	409
$n$	13	13	13	19	19	19	31	31	31	31
$p$	421	443	463	487	491	523	563	709	751	787
$n$	37	37	37	37	41	43	47	61	67	61
$p$	823	829	859	883	907	947	967	991
$n$	73	73	67	73	79	79	79	79

Table 6. Table 6: Data for y 2 = x 3 + 2 superscript 𝑦 2 superscript 𝑥 3 2 y^{2}=x^{3}+2 .

Invariant	Value
Discriminant	$\Delta$	=	$-16\left(4a^3+27b^2\right)=-1728$
Conductor	$N$	=	$1728$
j-Invariant	$j\left(E\right)$	=	${\left(-48b\right)}^3/\Delta =0$
Rank	$\mathrm{rk}\left(E\right)$	=	$1$
Special $L$-Value	$L^{{}^{\prime }}(E,1)$	$\approx$	$2.82785747365$
Regulator	$R$	=	$.754576$
Real Period	$\Omega$	=	$5.24411510858$
Torsion Group	$E{\left(\mathbb{Q}\right)}_{\text{tors}}$	$\cong$	$\left\{𝒪\right\}$
Integral Points	$E\left(\mathbb{Z}\right)$	=	$\{𝒪,(-1,1);(-1,1)\}$
Rational Group	$E\left(\mathbb{Q}\right)$	$=$	$\mathbb{Z}$
Endomorphims Group	$End\left(E\right)$	=	$\mathbb{Z}\left[\left(1+\sqrt{-3}\right)/2\right]$, CM
Integer Divisor	$d_E$	=	$1$

Table 7. Table 7: Data for y 2 = x 3 + 6 ​ x − 2 superscript 𝑦 2 superscript 𝑥 3 6 𝑥 2 y^{2}=x^{3}+6x-2 .

Invariant	Value
Discriminant	$\Delta$	=	$-16\left(4a^3+27b^2\right)=-2^6\cdot 3^5$
Conductor	$N$	=	$2^6\cdot 3^3$
j-Invariant	$j\left(E\right)$	=	${\left(-48b\right)}^3/\Delta =2^9\cdot 3$
Rank	$\mathrm{rk}\left(E\right)$	=	$0$
Special $L$-Value	$L(E,1)$	$\approx$	$2.24402797314$
Regulator	$R$	=	$1$
Real Period	$\Omega$	=	$2.2440797314$
Torsion Group	$E{\left(\mathbb{Q}\right)}_{\text{tors}}$	=	$\left\{𝒪\right\}$
Integral Points	$E\left(\mathbb{Z}\right)$	=	$\left\{𝒪\right\}$
Rational Group	$E\left(\mathbb{Q}\right)$	$=$	$\left\{𝒪\right\}$
Endomorphims Group	$End\left(E\right)$	=	$\mathbb{Z}$, nonCM
Integer Divisor	$d_E$	=	$1$

Table 8. Table 8: Data for y 2 = x 3 − x superscript 𝑦 2 superscript 𝑥 3 𝑥 y^{2}=x^{3}-x .

Invariant	Value
Discriminant	$\Delta$	=	$-16\left(4a^3+27b^2\right)=-2^6$
Conductor	$N$	=	$2^5$
j-Invariant	$j\left(E\right)$	=	${\left(-48b\right)}^3/\Delta =2^6\cdot 3^3$
Rank	$\mathrm{rk}\left(E\right)$	=	$0$
Special $L$-Value	$L(E,1)$	$\approx$	$.655514388573$
Regulator	$R$	=	$1$
Real Period	$\Omega$	=	$5.24411510858$
Torsion Group	$E{\left(\mathbb{Q}\right)}_{\text{tors}}$	$\cong$	${\mathbb{Z}}_2\times {\mathbb{Z}}_2$
Integral Points	$E\left(\mathbb{Z}\right)$	=	$\{𝒪,(\pm 1,0);(0,0)\}$
Rational Group	$E\left(\mathbb{Q}\right)$	$=$	$E{\left(\mathbb{Q}\right)}_{\text{tors}}$
Endomorphims Group	$End\left(E\right)$	=	$\mathbb{Z}\left[i\right]$, CM
Integer Divisor	$d_E$	=	$2,4,8$

Equations

$$\pi (x,E)$$

$$\pi (x,E,t)$$

$$\pi (x,E)=\#\{p\le x:p/|\Delta \text{ and }{d}_E^{-1}\cdot \#E({\mathbb{F}}_p)=\text{prime}\}.$$

$$\pi (x,E)\ge \delta (d_E,E)\frac{x}{{\log }^{2}x}\left(1+O\left(\frac{x}{\log x}\right)\right),$$

$$E(\mathbb{Q})/E(\mathbb{Q}{)}_{tors}⟶\mathbb{Z}/m\mathbb{Z},$$

$$mP=\mathcal{O}⟺{\psi }_m(P)=0,$$

$$\begin{array}[]{cll}E(\mathbb{F}_{p})&\longrightarrow&\mathbb{Z}/n\mathbb{Z},\\ \mathcal{O}&\longrightarrow&\log_{T}(\mathcal{O})=0,\\ T&\longrightarrow&\log_{T}(T)=1.\\ \end{array}$$

$$\chi (\mathcal{O})=e^{\frac{i2\pi }{n}{\log }_T(O)}=1,$$

$$\chi (mT)=e^{\frac{i2\pi }{n}{\log }_T(mT)}=e^{i2\pi m/n},$$

$$\Psi_{E}(P)=\sum_{d\,|\,n}\frac{\mu(d)}{d}\sum_{0\leq t<d}\chi(tP)=\left\{\begin{array}[]{ll}1&\text{ if }\operatorname{ord}_{E}(P)=n,\\ 0&\text{ if }\operatorname{ord}_{E}(P)\neq n.\\ \end{array}\right.$$

$$\Psi_{E}(P)=\sum_{\gcd(m,n)=1}\frac{1}{n}\sum_{0\leq r\leq n-1}\chi\left((mT-P)r\right)=\left\{\begin{array}[]{ll}1&\text{ if }\operatorname{ord}_{E}(P)=n,\\ 0&\text{ if }\operatorname{ord}_{E}(P)\neq n,\\ \end{array}\right.$$

$$mT-P=\mathcal{O},$$

$$\Psi_{E}(P)=\sum_{\gcd(m,n)=1}\frac{1}{n}\sum_{0\leq r\leq n-1}e^{i2\pi\log_{T}(mT-P)r/n}=\left\{\begin{array}[]{ll}1&\text{ if }\operatorname{ord}_{E}(P)=n,\\ 0&\text{ if }\operatorname{ord}_{E}(P)\neq n,\\ \end{array}\right.$$

$$\Lambda (n)=\{\begin{array}{ll}\log n& \text{ if }n=p^k,k\ge 1,\\ 0& \text{ if }n\ne p^k,k\ge 1,\end{array}$$

$$\sum _{x-y\le n\le x}\Lambda (n)>\frac{y}{2}.$$

$$\sum _{x\le p\le 2x}\frac{1}{4\sqrt{p}}\sum _{p-2\sqrt{p}\le n\le p+2\sqrt{p}}\frac{\Lambda (n)}{\log n}\cdot \frac{1}{n}\sum _{\gcd (m,n)=1}1\gg \frac{1}{2}\frac{x}{{\log }^{2}x}\left(1+O\left(\frac{x}{\log x}\right)\right).$$

$$M(x)$$

$$\frac{\Lambda (n)}{\log n}\frac{\phi (n)}{n}=\{\begin{array}{ll}\frac{\Lambda (n)}{\log n}\left(1-\frac{1}{n}\right)& \text{mbox}ifn=p^m,m\ge 1,\\ 0& \text{mbox}ifn=p^m,m\ge 1,\end{array}$$

$$M(x)$$

$$\pi (2x)-\pi (x)=\frac{x}{\log x}\left(1+O\left(\frac{1}{\log x}\right)\right)>\frac{x}{2\log x}$$

$$\sum _{p-2\sqrt{p}\le n\le p+2\sqrt{p}}\Lambda (n)>\frac{4\sqrt{p}}{2},$$

$$M(x)$$

$$\sum _{p-2\sqrt{p}\le n\le p+2\sqrt{p}}\Lambda (n)=o(\sqrt{p}).$$

$$C(x)$$

$$\sum _{p-2\sqrt{p}\le n\le p+2\sqrt{p}}\frac{\Lambda (n)}{\log n}\cdot \frac{1}{n}\sum _{\gcd (m,n)=1,}\sum _{1\le r<n}\chi ((mT-P)r)\le 2.$$

$$\chi (rmT)=e^{\frac{i2\pi }{n}{\log }_T(rmT)}=e^{i2\pi rm/n},$$

$$\chi (-rP)=e^{\frac{i2\pi }{n}{\log }_T(-rP)}=e^{-i2\pi rk/n},$$

$$T(p)$$

$$\sum _{0<r\le n-1}{e}^{-i2\pi rk/n}=-1\text{ and }\sum _{\gcd (m,n)=1}{e}^{i2\pi rm/n}=-1$$

$$T(p)$$

Full text

Note On Elliptic Groups of Prime Orders

N. A. Carella

Abstract: Let $E$ be an elliptic curve of rank $\operatorname{rk}(E)\geq 0$, and let $E(\mathbb{F}_{p})$ be the elliptic group of order $\#E(\mathbb{F}_{p})=n$. The number of primes $p\leq x$ such that $n$ is prime is expected to be $\pi(x,E)=\delta(E)x/\log^{2}x+o(x/\log^{2}x)$, where $\delta(E)\geq 0$ is the density constant. This note proves a lower bound $\pi(x,E)\gg x/\log^{2}x$.

Mathematics Subjects Classification: Primary 11G07; Secondary 11N36, 11G15.

Keywords: Elliptic Prime; Group of Prime Order, Primitive Point; Koblitz Conjecture.

1 Introduction

The applications of elliptic curves in cryptography demands elliptic groups of certain orders $n=\#E(\mathbb{F}_{p})$, and certain factorizations of the integers $n$. The extreme cases have groups of $\mathbb{F}_{p}$-rational points $E(\mathbb{F}_{p})$ of prime orders, and small multiples of large primes.

Conjecture 1.1** (Koblitz).**

Let $E:f(X,Y)=0$ be an elliptic curve of of discriminant $\Delta\neq 0$ defined over the integers $\mathbb{Z}$ which is not $\mathbb{Q}$-isogenous to a curve with nontrivial $\mathbb{Q}$-torsion and does not have CM. Then,

[TABLE]

for large $x\geq 1$.

A new refined version of this conjecture, for any elliptic curve over any number field $\mathcal{K}$, was recently proposed. The simpler case for the rational number field is stated below.

Conjecture 1.2** ([30]).**

Let $E$ be an elliptic curve defined over the rational number field $\mathbb{Q}$, and let $t\geq 1$ be a positive integer. Then, there is an explicit constant $C(E,t)>0$ such that

[TABLE]

for large $x\geq 1$.

The product expression appearing in the above formula (1.1 ) is basically the average density of prime orders, some additional details are given in Section 7. A result for groups of prime orders generated by primitive points is proved here. Let

[TABLE]

The parameter $t=d_{E}\geq 1$ is a small integer defined in Section 6.

Theorem 1.1**.**

Let $E:f(X,Y)=0$ be an elliptic curve over the rational numbers $\mathbb{Q}$ of rank $\operatorname{rk}(E(\mathbb{Q})>0$. Then, as $x\to\infty$,

[TABLE]

where $\delta(d_{E},E)$ is the density constant.

The proof of this result is split into several parts. The next sections are intermediate results. The proof of Theorem 1.1 is assembled in the penultimate section, and the last section has examples of elliptic curves with infinitely many elliptic groups $E(\mathbb{F}_{p})$ of prime orders $n$.

2 Representation of the Characteristic Function

2.1 Primitive Points Tests

For a prime $p\geq 2$, the group of points on an elliptic curve $E:y^{2}=f(x)$ is denoted by $E(\mathbb{F}_{p})$. Several definitions and elementary properties of elliptic curves and the $n$-division polynomial $\psi_{n}(x,y)$ are sketched in Chapter 14.

Definition 2.1**.**

The order $\min\{k\in\mathbb{N}:kP=\mathcal{O}\}$ of an elliptic point is denoted by $\operatorname{ord}_{E}(P)$. A point is a primitive point if and only if $\operatorname{ord}_{E}(P)=n$.

Lemma 2.1**.**

If $E(\mathbb{F}_{p})$ is a cyclic group, then it contains a primitive point $P\in E(\mathbb{F}_{p})$.

Proof.

By hypothesis, $E(\mathbb{F}_{p})\cong\mathbb{Z}/n\mathbb{Z}$, and the additive group $\mathbb{Z}/n\mathbb{Z}$ contains $\varphi(n)\geq 1$ generators (primitive roots). ∎

More generally, there is map into a cyclic group

[TABLE]

for some $m=\#E(\mathbb{F}_{p})/d$, with $d\geq 1$; and the same result stated in the Lemma holds in the smaller cyclic group $\mathbb{Z}/m\mathbb{Z}\subset\mathbb{Z}/n\mathbb{Z}$.

Lemma 2.2**.**

Let $\#E(\mathbb{F}_{p})=n$ and let $P\in E(\mathbb{F}_{p})$. Then, $P$ is a primitive point if and only if $(n/q)P\neq\mathcal{O}$ for all prime divisors $q\,|\,n$.

Basically, this is the classical Lucas-Lehmer primitive root test applied to the group of points $E(\mathbb{F}_{p})$. Another primitive point test intrinsic to elliptic curves is the $n$-division polynomial test.

Lemma 2.3**.**

($n$-Division primitive point test)* Let $\#E(\mathbb{F}_{p})=n$ and let $P\in E(\mathbb{F}_{p})$. Then, $P$ is a primitive point if and only if $\psi_{n/q}(P)\neq 0$ for all prime divisors $q\,|\,n$.*

The basic proof stems from the division polynomial relation

[TABLE]

see [28, Proposition 1.25]. The elliptic primitive point test calculations in the penultimate lemma takes place in the set of integer pairs $\mathbb{Z}\times\mathbb{Z}$, while the calculations for the $n$-division polynomial primitive point test takes place over the set of integers $\mathbb{Z}$. The elementary properties of the $n$-division polynomials are discussed in [28], and the periodic property of the $n$-division polynomials appears in [26].

2.2 Additive Elliptic Character

The discrete logarithm function, with respect to the fixed primitive point $T$, maps the group of points into a cyclic group. The diagram below specifies the basic assignments.

[TABLE]

In view of these information, an important character on the group of $E(\mathbb{F}_{p})$-rational points can be specified.

Definition 2.2**.**

A nontrivial additive elliptic character $\chi\bmod n$ on the group $E(\mathbb{F}_{p})$ is defined by

[TABLE]

and

[TABLE]

where $\log_{T}(mT)=m$ with $m\in\mathbb{Z}$.

2.3 Divisors Dependent Characteristic Function

A characteristic function for primitive points on elliptic curve is described in the [27, p. 5]; it was used there to derive a primitive point search algorithm.

Lemma 2.4**.**

Let $E$ be a nonsingular elliptic curve, and let $E(\mathbb{F}_{p})$ be its group of points of cardinality $n=\#E(\mathbb{F}_{p})$. Let $\chi$ be the additive character of order $d$ modulo $d$, and assume $P=(x_{0},y_{0})$ is a point on the curve. Then,

[TABLE]

2.4 Divisors Free Characteristic Function

A new divisors-free representation of the characteristic function of elliptic primitive points is developed here. This representation can overcomes some of the limitations of its equivalent in 2.4 in certain applications. The divisors representation of the characteristic function of elliptic primitive points, Lemma 2.4, detects the order $\text{ord}_{E}(P)$ of the point $P\in E(\mathbb{F}_{p})$ by means of the divisors of the order $n=\#E(\mathbb{F}_{p})$. In contrast, the divisors-free representation of the characteristic function, Lemma 2.5, detects the order $\text{ord}_{E}(P)\geq 1$ of a point $P\in E(\mathbb{F}_{p})$ by means of the solutions of the equation $mT-P=\mathcal{O}$, where $P,T\in E(\mathbb{F}_{p})$ are fixed points, $\mathcal{O}$ is the identity point, and $m$ is a variable such that $0\leq m\leq n-1$, and $\gcd(m,n)=1$.

Lemma 2.5**.**

Let $p\geq 2$ be a prime, and let $T$ be a primitive point in $E(\mathbb{F}_{p})$. For a nonzero point $P\in E(\mathbb{F}_{p})$ of order $n$ the following hold: If $\chi\neq 1$ is a nonprincipal additive elliptic character of order $\operatorname{ord}\chi=n$, then

[TABLE]

where $n=\#E(\mathbb{F}_{p})$ is the order of the rational group of points.

Proof.

As the index $m\geq 1$ ranges over the integers relatively prime to $n$, the element $mT\in E(\mathbb{F}_{p})$ ranges over the elliptic primitive points. Ergo, the linear equation

[TABLE]

where $P,T\in E(\mathbb{F}_{p})$ are fixed points, $\mathcal{O}$ is the identity point, and $m$ is a variable such that $0\leq m\leq n-1$, and $\gcd(m,n)=1$, has a solution if and only if the fixed point $P\in E(\mathbb{F}_{p})$ is an elliptic primitive point. Next, replace $\chi(t)=e^{i2\pi t/n}$ to obtain

[TABLE]

This follows from the geometric series identity $\sum_{0\leq k\leq N-1}w^{k}=(w^{N}-1)/(w-1)$ with $w\neq 1$, applied to the inner sum. ∎

3 Primes In Short Intervals

There are many unconditional results for the existence of primes in short intervals $[x,x+y]$ of subsquareroot length $y\leq x^{1/2}$ for almost all large numbers $x\geq 1$. One of the earliest appears to be the Selberg result for $y=x^{19/77}$ with $x\leq X$ and $O\left(X(\log X)^{2}\right)$ exceptions, see [24, Theorem 4]. Recent improvements based on different analytic methods are given in [32], [10], and other authors. One of these results, but not the best, has the following claim. This calculation involves the weighted prime indicator function (vonMangoldt), which is defined by

[TABLE]

where $p^{k},k\geq 1$, is a prime power.

Theorem 3.1**.**

([10]) Given $\varepsilon>0$, almost all intervals of the form $[x-x^{1/6+\varepsilon},x]$ contains primes except for a set of $x\in[X,2X]$ with measure $O\left(X(\log X)^{-C+1}\right)$, and $C>1$ constant. Moreover,

[TABLE]

Proof.

The proof is based on zero density theorems, see [10, p. 190]. ∎

An introduction to zero density theorems and its application to primes in short intervals are given in [16, p. 98], [12, p. 264], et cetera.

The same result works for larger intervals $[x-x^{\theta+\varepsilon},x]$, where $\theta\in(1/6,1/2)$ and $(1-\theta)C<2$, with exceptions $O\left(X(\log X)^{-C+1}\right),C>1$.

4 Evaluation Of The Main Term

A lower bound for the main term $M(x)$ in the proof of Theorem 1.1 is evaluated here.

Lemma 4.1**.**

Let $x\geq 1$ be a large number, and let $p\in[x,2x]$ be prime. Then,

[TABLE]

Proof.

The main term can be rewritten in the form

[TABLE]

The Euler phi function $\varphi(n)=\#\{1\leq m<n:\gcd(m,n)=1\}$, and it has the value $\varphi(n)/n=1-1/n$ at a prime argument $n$. Thus, the expression

[TABLE]

is supported on the set of prim powers $n=p^{m},m\geq 1$. Consequently,

[TABLE]

since $1-1/n\geq 1/2$. Now observe that as the prime $p\in[x,2x]$ varies, the number of intervals $[p-2\sqrt{p},p+2\sqrt{p}]$ is the same as the number of primes in the interval $[x,2x]$, namely,

[TABLE]

for large $x\geq 1$. By Theorem 3.1, the finite sum over the short interval satisfies

[TABLE]

with $O\left(x\log^{-C}x\right)$ exceptions $p\in[x,2x]$, where $1<C<4$. Take $C>2$, then, the number of exceptions is small in comparison to the number of intervals $\pi(2x)-\pi(x)>x/2\log x$ for large $x\geq 1$. Hence, an application of this Theorem yields

[TABLE]

where all the errors terms are absorbed into one term. ∎

Remark 4.1. The exceptional intervals $[p-2\sqrt{p},p+2\sqrt{p}]$, with $p\in[x,2x]$, contain fewer primes, that is,

[TABLE]

This shortfalls is accounted for in the correction term

[TABLE]

where $C>2$, in the previous calculation.

5 Estimate For The Error Term

The analysis of an upper bound for the error term $E(x)$, which occurs in the proof of Theorem 1.1, is split into two parts. The first part in Lemma 5.1 is an estimate for the triple inner sum. And the final upper bound is assembled in Lemma 5.2.

Lemma 5.1**.**

Let $E$ be a nonsingular elliptic curve over rational number, let $P\in E(\mathbb{Q})$ be a point of infinite order. Let $x\geq 1$ be a large number. For each prime $p\geq 3$, fix a primitive point $T$, and suppose that $P\in E(\mathbb{F}_{p})$ is not a primitive point for all primes $p\geq 2$, then

[TABLE]

Proof.

Let $\log_{T}:E(\mathbb{F}_{p})\longrightarrow\mathbb{Z}_{n}$ be the discrete logarithm function with respect to the fixed primitive point $T$, defined by $\log_{T}(mT)=m$, $\log_{T}(P)=k$, and $\log_{T}(\mathcal{O})=0$. Then, the nontrivial additive character evaluates to

[TABLE]

and

[TABLE]

respectively. To derive a sharp upper bound, rearrange the inner double sum as a product

[TABLE]

The hypothesis $mT-P\neq\mathcal{O}$ for $m\geq 1$ such that $\gcd(m,n)=1$ implies that the two inner sums in (5) are complete geometric series, except for the terms for $m=0$ and $r=0$ respectively. Moreover, since $n\geq 2$ is a prime, the two geometric sums have the exact evaluations

[TABLE]

for any $1\leq k<n$, and $1\leq r<n$ respectively. Therefore, it reduces to

[TABLE]

refer to [23, Theorem 2.7] for additional details. ∎

Lemma 5.2**.**

Let $E$ be a nonsingular elliptic curve over rational number, let $P\in E(\mathbb{Q})$ be a point of infinite order. For each large prime $p\geq 3$, fix a primitive point $T$, and suppose that $P\in E(\mathbb{F}_{p})$ is not a primitive point for all primes $p\geq 2$, then

[TABLE]

Proof.

By assumption $P\in E(\mathbb{F}_{p})$ is not a primitive point. Hence, the linear equation $mT-P=\mathcal{O}$ has no solution $m\in\{m:\gcd(m,n)=1\}$. This implies that the discrete logarithm $\log_{T}(mT-P)\neq 0$, and $\sum_{1\leq r<n}\chi((mT-P)r)=-1$. This in turns yields

[TABLE]

Here, the inequality $(1/n)\sum_{\gcd(m,n)=1}1=\varphi(n)/n\leq 1/2$ for all integers $n\geq 1$ was used in the second line. Hence, there is a sharper nontrivial upper bound for the error term. To derive a sharper upper bound, take absolute value, and apply Lemma 5.1 to the inner triple sum to obtain this:

[TABLE]

The last line uses the trivial estimate $\sum_{x\leq p\leq 2x}1\leq x$. ∎

6 Elliptic Divisors

The divisor $\text{div}(f)=\gcd(f(\mathbb{Z}))$ of a polynomial $f(x)$ is the greatest common divisor of all its values over the integers, confer [7, p. 395]. Basically, the same concept extents to the setting of elliptic groups of prime orders, but it is significantly more complex.

Definition 6.1**.**

Let $\mathcal{O}_{\mathcal{K}}$ be the ring of integers of a quadratic numbers field $\mathcal{K}$. The elliptic divisor is an integer $d_{E}\geq 1$ defined by

[TABLE]

Considerable works, [3], [22], [11], [14], have gone into determining the elliptic divisors for certain classes of elliptic curves.

Theorem 6.1**.**

([14, Proposition 1])* The divisor of an elliptic curve $E:y^{2}=x^{3}+ax+b$ over the rational numbers $\mathbb{Q}$ with complex multiplication by $\mathbb{Q}(\sqrt{D})$ and conductor $N$ satisfies $d_{E}|24$. The complete list, with $c,m\in\mathbb{Z}-\{0\}$, is the following.

[TABLE]

7 Densities Expressions

The product expression appearing in Conjecture 1.1, id est,

[TABLE]

is the basic the average density of prime orders, it was proved in [17], and very recently other proofs are given in [1, Theorem 1 ], [15], [21], et alii. The actual density has a slight dependence on the elliptic curve $E$ and the point $P$. The determination of the dependence is classified into several cases depending on the torsion groups $E(\mathbb{Q})_{\text{tors}}$, and other parameters.

Lemma 7.1**.**

([30, Proposition 4.2]). Let $E:f(x,y)=0$ be a Serre curve over the rational numbers. Let $D$ be the discriminant of the numbers field $\mathbb{Q}(\sqrt{\Delta})$, where $\Delta$ is the discriminant of any Weierstrass model of $E$ over $\mathbb{Q}$. If $d_{E}=1$, then

[TABLE]

8 Elliptic Brun Constant

Assuming the generalized Riemann hypothesis, the upper bound

[TABLE]

was proved in [3] and [31]. In addition, the unconditional upper bound

[TABLE]

for elliptic curves with complex multiplication was proved in [3, Proposition 7]. Later, the same upper bound for elliptic curves without complex multiplication was proved in [31, Theorem 1.3]. An improved version for any elliptic curve over the rational numbers is proved here.

Lemma 8.1**.**

For any large number $x\geq 1$ and any elliptic curves $E:f(X,Y)=0$ of discriminant $\Delta\neq 0$,

[TABLE]

Proof.

The number of such elliptic primitive primes has the asymptotic formula

[TABLE]

where $\Psi_{E}(P)$ is the charateritic function of primitive points $P\in E(\mathbb{Q})$. This is obtained from the summation of the elliptic primitive primes density function over the interval $[1,x]$, see (54).

Since $\Psi_{E}(P)=0,1$, the previous equation has the upper bound

[TABLE]

where $q$ ranges over the primes in the short interval $[p-2\sqrt{p},p+2\sqrt{p}]$. The inner sum is estimated using either the explicit formula or Brun-Titchmarsh theorem. The later result states that the number of primes $p$ in the short interval $[x,x+4\sqrt{x}]$ satisfies the inequality

[TABLE]

see [12, p.  167], [23, Theorem 3.9], and [29, p.  83], and similar references. Replacing (41) into (8) yields

[TABLE]

The last inequality follows by partial summation and the prime number theorem $\pi(x)=x/\log x+O(x/\log^{2}x)$. ∎

This result facilitates the calculations of a new collection of constants associated with elliptic curves. The best known results have established the sum

[TABLE]

but does not establish the convergence of this series, see [3] and [31]. The convergence of this series is proved below.

Corollary 8.1**.**

For any elliptic curve $E$, the elliptic Brun constant

[TABLE]

converges.

Proof.

Use the prime counting measure $\pi(x,E,t)\leq 6x/\log^{2}x+O(x/\log^{3}x)$ in Theorem 1.1 to evaluate the infinite sum

[TABLE]

as claimed. ∎

Corollary 8.2**.**

For any elliptic curve $E$, the elliptic Brun constant

[TABLE]

converges.

Proof.

Use the prime counting measure $\pi(x,E)\leq 6x/\log^{2}x+O(x/\log^{3}x)$ in Lemma 8.1 to evaluate the infinite sum

[TABLE]

as claimed. ∎

The elliptic Brun constants and the numerical data for the prime orders of a few elliptic curves were compiled. The last example shows the highest density of prime orders. Accorddingly, it has the largest constant.

Example 8.1**.**

The nonsingular Bachet elliptic curve $E:y^{2}=x^{3}+2$ over the rational numbers has complex multiplication by $\mathbb{Z}[\rho]$, and nonzero rank $\operatorname{rk}(E)=1$. The data for $p\leq 1000$ with prime orders $n$ are listed on the Table 1; and the elliptic Brun constant is

[TABLE]

Example 8.2**.**

The nonsingular elliptic curve $E:y^{2}=x^{3}+6x-2$ over the rational numbers has no complex multiplication and zero rank $\operatorname{rk}(E)=0$. The data for $p\leq 1000$ with prime orders $n$ are listed on the Table 2; and the elliptic Brun constant is

[TABLE]

Example 8.3**.**

The nonsingular elliptic curve $E:y^{2}=x^{3}-x$ over the rational numbers has complex multiplication by $\mathbb{Z}[\rho]$, and nonzero rank $\operatorname{rk}(E)=0$. The data for $p\leq 1000$ with prime orders $n/4$ are listed on the Table 3; and the elliptic Brun constant is

[TABLE]

Example 8.4**.**

The nonsingular elliptic curve $E:y^{2}=x^{3}-x$ over the rational numbers has complex multiplication by $\mathbb{Z}[\rho]$, and nonzero rank $\operatorname{rk}(E)=0$. The data for $p\leq 1000$ with prime orders $n/8$ are listed on the Table 4; and the elliptic Brun constant is

[TABLE]

Example 8.5**.**

The nonsingular Bachet elliptic curve $E:y^{2}=x^{3}+1$ over the rational numbers has complex multiplication by $\mathbb{Z}[\rho]$, and nonzero rank $\operatorname{rk}(E)=?1$. The data for $p\leq 1000$ with prime orders $n/12$ are listed on the Table 5; and the elliptic Brun constant is

[TABLE]

9 Prime Orders $n$

The characteristic function for primitive points in the group of points $E(\mathbb{F}_{p})$ of an elliptic curve $E:f(X,Y)=0$ has the representation

[TABLE]

The parameter $n=\#E(\mathbb{F}_{p})$ is the size of the group of points, and the exact formula for $\Psi_{E}(P)$ is given in Lemma 2.5.

Since each order $n$ is unique, the weighted sum

[TABLE]

where $n=q^{k},k\geq 1$, is a prime power, is a discrete measure for the density of elliptic primitive primes $p\geq 2$ such that $P\in E(\mathbb{\overline{Q}})$ is a primitive point of prime power order $n\in[p-2\sqrt{p},p+2\sqrt{p}]$.

Proof.

(Theorem 1.1). Let $\langle P\rangle=E(\mathbb{F}_{p})$ for at least one large prime $p\leq x_{0}$, and let $x\geq x_{0}\geq 1$ be a large number. Suppose that $P\not\in E(\mathbb{Q})_{\text{tors}}$ is not a primitive point of prime order $\operatorname{ord}_{E}(P)=n$ in $E(\mathbb{F}_{p})$ for all primes $p\geq x$. Then, the sum of the elliptic primes measure over the short interval $[x,2x]$ vanishes. Id est,

[TABLE]

Replacing the characteristic function, Lemma 2.5, and expanding the nonexistence equation (55) yield

[TABLE]

where $\delta(d_{E},E)\geq 0$ is a constant depending on both the fixed elliptic curve $E:f(X,Y)=0$ and the integer divisor $d_{E}$.

The main term $M(x)$ is determined by a finite sum over the principal character $\chi=1$, and the error term $E(x)$ is determined by a finite sum over the nontrivial multiplicative characters $\chi\neq 1$.

Applying Lemma 4.1 to the main term, and Lemma 5.2 to the error term yield

[TABLE]

But, if $\delta(d_{E},E)>0$, the expression

[TABLE]

contradicts the hypothesis (55) for all large numbers $x\geq x_{0}$. Ergo, there are infinitely many primes $p\geq x$ such that a fixed elliptic curve of rank $\operatorname{rk}(E)>0$ with a primitive point $P$ of infinite order, for which the corresponding groups $E(\mathbb{F}_{p})$ have prime orders. Lastly, the number of such elliptic primitive primes has the asymptotic formula

[TABLE]

which is obtained from the summation of the elliptic primitive primes density function over the interval $[1,x]$. ∎

10 Examples Of Elliptic Curves

The densities of several elliptic curves have been computed by several authors. Extensive calculations for some specific densities are given in [30].

Example 10.1**.**

The nonsingular Bachet elliptic curve $E:y^{2}=x^{3}+2$ over the rational numbers has complex multiplication by $\mathbb{Z}[\rho]$, and nonzero rank $\operatorname{rk}(E)=1$. It is listed as 1728.n4 in [20]. The numerical data shows that $\#E(\mathbb{F}_{p})=n$ is prime for at least one prime, see Table 1. Hence, by Theorem 1.1, the corresponding group of $\mathbb{F}_{p}$-rational points $\#E(\mathbb{F}_{p})$ has prime orders $n=\#E(\mathbb{F}_{p})$ for infinitely many primes $p\geq 3$.

Since $\Delta=-2^{6}\cdot 3^{3}$, the discriminant of the quadratic field $\mathbb{Q}(\sqrt{\Delta})$ is $D=-3$. Moreover, the integer divisor $d_{E}=1$ since $\#E(\mathbb{F}_{p})$ is prime for at least one prime. Thus, applying Lemma 7.1, gives the natural density

[TABLE]

The predicted number of elliptic primes $p\nmid 6N$ such that $\#E(\mathbb{F}_{p})$ is prime has the asymptotic formula

[TABLE]

A lower bound for the counting function is

[TABLE]

see Theorem 1.1.

The associated weight $k=2$ cusp form, and $L$-function are

[TABLE]

and

[TABLE]

where $q=e^{i2\pi}$, respectively. The coefficients are generated using $a_{p}=p+1-\#E(\mathbb{F}_{p})$, and the formulas

$a_{pq}=a_{p}a_{q}$ if $\gcd(p,q)=1$; 2. 2.

$a_{p^{n+1}}=a_{p^{n}}a_{p}-pa_{p^{n-1}}$ if $n\geq 2$.

The corresponding functional equation is

[TABLE]

where $N=1728$, see [18, p. 80]. **

Example 10.2**.**

The nonsingular elliptic curve $E:y^{2}=x^{3}+6x-2$ over the rational numbers has no complex multiplication and zero rank, it is listed as 1728.w1 in [20]. The numerical data shows that $\#E(\mathbb{F}_{p})=n$ is prime for at least one prime, see Table 2. Hence, by Theorem 1.1, the corresponding group of $\mathbb{F}_{p}$-rational points $\#E(\mathbb{F}_{p})$ has prime orders $n=\#E(\mathbb{F}_{p})$ for infinitely many primes $p\geq 3$.

Since $\Delta=-2^{6}\cdot 3^{5}$, the discriminant of the quadratic field $\mathbb{Q}(\sqrt{\Delta})$ is $D=-3$. Moreover, the integer divisor $d_{E}=1$ since $\#E(\mathbb{F}_{p})$ is prime for at least one prime. Thus, applying Lemma 7.1, gives the natural density

[TABLE]

The predicted number of elliptic primes $p\nmid 6N$ such that $\#E(\mathbb{F}_{p})$ is prime has the asymptotic formula

[TABLE]

A table for the prime counting function $\pi(1,E)$, for $2\times 10^{7}\leq x\leq 10^{9}$, and other information on this elliptic curve appears in [30].

A lower bound for the counting function is

[TABLE]

see Theorem 1.1.

The associated weight $k=2$ cusp form, and $L$-function are

[TABLE]

and

[TABLE]

where $q=e^{i2\pi}$, respectively. The coefficients are generated using $a_{p}=p+1-\#E(\mathbb{F}_{p})$, and the formulas

$a_{pq}=a_{p}a_{q}$ if $\gcd(p,q)=1$; 2. 2.

$a_{p^{n+1}}=a_{p^{n}}a_{p}-pa_{p^{n-1}}$ if $n\geq 2$.

The corresponding functional equation is

[TABLE]

where $N=1728$, see [18, p. 80]. **

Example 10.3**.**

The nonsingular elliptic curve $E:y^{2}=x^{3}-x$ over the rational numbers has complex multiplication by $\mathbb{Z}[i]$, and zero rank, it is listed as 32.a3 in [20]. The numerical data shows that $\#E(\mathbb{F}_{p})/8=n$ is prime for at least one prime, see (LABEL:800-95). Hence, by Theorem 1.1, the corresponding group of $\mathbb{F}_{p}$-rational points $\#E(\mathbb{F}_{p})$ has prime orders $n=\#E(\mathbb{F}_{p})$ for infinitely many primes $p\geq 3$.

Since $\Delta=-2^{6}$, the discriminant of the quadratic field $\mathbb{Q}(\sqrt{\Delta})$ is $D=-4$. Moreover, the integer divisor $d_{E}=8$ since $\#E(\mathbb{F}_{p})/8$ is prime for at least one prime, see Table 4. Thus, Lemma 7.1 is not applicable. The natural density

[TABLE]

where $\chi(n)=(-1)^{(n-1)/2}$, is computed in [30, Lemma 7.1]. The predicted number of elliptic primes $p\nmid 6N$ such that $\#E(\mathbb{F}_{p})$ is prime has the asymptotic formula

[TABLE]

A table for the prime counting function $\pi(x,E)$, for $2\times 10^{7}\leq x\leq 10^{9}$, and other information on this elliptic curve appears in [30].

A lower bound for the counting function is

[TABLE]

see Theorem 1.1.

The associated weight $k=2$ cusp form, and $L$-function are

[TABLE]

and

[TABLE]

where $q=e^{i2\pi}$, respectively. The coefficients are generated using $a_{p}=p+1-\#E(\mathbb{F}_{p})$, and the formulas

$a_{pq}=a_{p}a_{q}$ if $\gcd(p,q)=1$; 2. 2.

$a_{p^{n+1}}=a_{p^{n}}a_{p}-pa_{p^{n-1}}$ if $n\geq 2$.

The corresponding functional equation is

[TABLE]

where $N=1728$, see [18, p. 80]. **

11 Exercises

Problem 1. Assume random elliptic curve $E:f(x,y)=0$ has no CM, $P$ is a point of infinite order. Is the integer divisor $d_{E}<\infty$ bounded? This parameter is bounded for CM elliptic curves, in fact $d_{E}<24$, reference: [14, Proposition 1].

Problem 2. Assume the elliptic curve $E:f(x,y)=0$ has no CM, $P$ is a point of infinite order, and the density $\delta(1,E)>0$. What is the least prime $p\nmid 6N$ such that the integer divisor $d_{E}=1$? Reference: [5, Corollary 1.2].

Problem 3. Fix an elliptic curve $E:y^{2}=x^{3}+ax+b$ of rank $\operatorname{rk}(E)>0$, and CM; and $P$ is a point of infinite order. Let the integer divisor $d_{E}=4$. Assume the densities $\delta(1,E)>0$, $\delta(2,E)>0$, and $\delta(4,E)>0$ are defined. What is the arithmetic relationship between the densities?

Problem 4. Fix an elliptic curve $E:y^{2}=x^{3}+ax+b$ of rank $\operatorname{rk}(E)>0$, and CM; and $P$ is a point of infinite order. Does $\#E(\mathbb{F}_{p})=n$ prime for at least one large prime $p\geq 2$ implies that the integer divisor $d_{E}=1$?