Search arXivSearch

arXiv · 2504.18732

Almost Prime Orders of Elliptic Curves Over Prime Power Fields

Abstract

In 1988, Koblitz conjectured the infinitude of primes p for which |E(F_p)| is prime for elliptic curves E over Q, drawing an analogy with the twin prime conjecture. He also proposed studying the primality of |E(F_{p^l})| / |E(F_p)|, in parallel with the primality of (p^l - 1)/(p - 1). Motivated by these problems and earlier work on |E(F_p)|, we study the infinitude of primes p such that |E(F_{p^l})| / |E(F_p)| has a bounded number of prime factors for primes l >= 2, considering both CM and non-CM elliptic curves over Q. In the CM case, we focus on the curve y^2 = x^3 - x to address gaps in the literature and present a more concrete argument. The result is unconditional and applies Huxley's large sieve inequality for the associated CM field. In the non-CM case, analogous results follow under GRH via the effective Chebotarev density theorem. For the CM curve y^2 = x^3 - x, we further apply a vector sieve to combine the almost prime properties of |E(F_p)| and |E(F_{p^2})| / |E(F_p)|, establishing a lower bound for the number of primes p <= x for which |E(F_{p^2})| / 32 is a square-free almost prime. We also study cyclic subgroups of finite index in E(F_p) and E(F_{p^2}) for CM curves.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Likun Xie. 2025-04-25. Almost Prime Orders of Elliptic Curves Over Prime Power Fields. https://arxiv.org/abs/2504.18732

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT