Pith. Sign in

RECORD

Non-CM elliptic curves with infinitely many almost prime Frobenius traces

Number Theory · Submitted 18 Jul 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In particular, we prove the following results: (i) the number of primes $p < x$ for which $|a_p(E)|$ is a prime is bounded from above by $C_1(E) \frac{x}{(\log x)^2}$ for some constant $C_1(E)$; (ii) the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 4 distinct primes, counted without multiplicity, is bounded from below by $C_2(E) \frac{x}{(\log x)^2}$ for some constant $C_2(E)$; (iii) the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 5 distinct primes, counted with multiplicity, is bounded from below by $C_3(E) \frac{x}{(\log x)^2}$ for some positive constant $C_3(E) > 0$.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2207.08322 (version 1)
Pith IDQ64SNBSD, Pith's permanent record of this paper and its review
CitationAlina Carmen Cojocaru, McKinley Meyer. "Non-CM elliptic curves with infinitely many almost prime Frobenius traces." arXiv:2207.08322 (2022). https://pith.science/paper/Q64SNBSD
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,376 input tokens.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.86 · human participants 0.01 · controlled comparison 0.01 · randomized assignment 0.01 · states quantitative result 0.98 · compares with prior results 0.08 · mentions code or data availability 0.01.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the reduction $E_p$ of $E$ modulo $p$. Under the Generalized Riemann Hypothesis (GRH), we study the primes $p$ for which the integer $|a_p(E)|$ is a prime. In particular, we prove the following results: (i) the number of primes $p < x$ for which $|a_p(E)|$ is a prime is bounded from above by $C_1(E) \frac{x}{(\log x)^2}$ for some constant $C_1(E)$; (ii) the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 4 distinct primes, counted without multiplicity, is bounded from below by $C_2(E) \frac{x}{(\log x)^2}$ for some constant $C_2(E)$; (iii) the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 5 distinct primes, counted with multiplicity, is bounded from below by $C_3(E) \frac{x}{(\log x)^2}$ for some positive constant $C_3(E) > 0$. Under GRH, we also prove the convergence of the sum of the reciprocals of the primes $p$ for which $|a_p(E)|$ is a prime. Furthermore, under GRH, together with Artin's Holomorphy Conjecture and a Pair Correlation Conjecture for Artin L-functions, we prove that the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 2 distinct primes, counted with multiplicity, is bounded from below by $C_4(E) \frac{x}{(\log x)^2}$ for some constant $C_4(E)$. The constants $C_i(E)$, $1 \leq i \leq 4$, are defined explicitly in terms of $E$ and are factors of another explicit constant $C(E)$ that appears in the conjecture that $\#\{p < x: |a_p(E)| \ \text{is prime}\} \sim C(E) \frac{x}{(\log x)^2}$.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. background 0.99 0.06 0.01 asserted 0.88
s1 For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the reduction $E_p$ of $E$ modulo $p$. background 1.00 0.10 0.01 asserted 0.91
s2 Under the Generalized Riemann Hypothesis (GRH), we study the primes $p$ for which the integer $|a_p(E)|$ is a prime. contribution 0.85 0.77 0.05 asserted 0.72
s3 In particular, we prove the following results: (i) the number of primes $p < x$ for which $|a_p(E)|$ is a prime is bounded from above by $C_1(E) \frac{x}{(\log x)^2}$ for some constant $C_1(E)$; (ii) the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 4 distinct primes, counted without multiplicity, is bounded from below by $C_2(E) \frac{x}{(\log x)^2}$ for some constant $C_2(E)$; (iii) the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 5 distinct primes, counted with multiplicity, is bounded from below by $C_3(E) \frac{x}{(\log x)^2}$ for some positive constant $C_3(E) > 0$. result 0.98 0.95 0.75 asserted 1.00
s4 Under GRH, we also prove the convergence of the sum of the reciprocals of the primes $p$ for which $|a_p(E)|$ is a prime. result 1.00 0.95 0.10 asserted 1.00
s5 Furthermore, under GRH, together with Artin's Holomorphy Conjecture and a Pair Correlation Conjecture for Artin L-functions, we prove that the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 2 distinct primes, counted with multiplicity, is bounded from below by $C_4(E) \frac{x}{(\log x)^2}$ for some constant $C_4(E)$. result 0.97 0.92 0.13 asserted 1.00
s6 The constants $C_i(E)$, $1 \leq i \leq 4$, are defined explicitly in terms of $E$ and are factors of another explicit constant $C(E)$ that appears in the conjecture that $\#\{p < x: |a_p(E)| \ \text{is prime}\} \sim C(E) \frac{x}{(\log x)^2}$. interpretation 0.50 0.74 0.07 asserted 0.97

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the reduction $E_p$ of $E$ modulo $p$. Under the Generalized Riemann Hypothesis (GRH), we study the primes $p$ for which the integer $|a_p(E)|$ is a prime. In particular, we prove the following results: (i) the number of primes $p < x$ for which $|a_p(E)|$ is a prime is bounded from above by $C_1(E) \frac{x}{(\log x)^2}$ for some constant $C_1(E)$; (ii) the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 4 distinct primes, counted without multiplicity, is bounded from below by $C_2(E) \frac{x}{(\log x)^2}$ for some constant $C_2(E)$; (iii) the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 5 distinct primes, counted with multiplicity, is bounded from below by $C_3(E) \frac{x}{(\log x)^2}$ for some positive constant $C_3(E) > 0$. Under GRH, we also prove the convergence of the sum of the reciprocals of the primes $p$ for which $|a_p(E)|$ is a prime. Furthermore, under GRH, together with Artin's Holomorphy Conjecture and a Pair Correlation Conjecture for Artin L-functions, we prove that the number of primes $p < x$ for which $|a_p(E)|$ is the product of at most 2 distinct primes, counted with multiplicity, is bounded from below by $C_4(E) \frac{x}{(\log x)^2}$ for some constant $C_4(E)$. The constants $C_i(E)$, $1 \leq i \leq 4$, are defined explicitly in terms of $E$ and are factors of another explicit constant $C(E)$ that appears in the conjecture that $\#\{p < x: |a_p(E)| \ \text{is prime}\} \sim C(E) \frac{x}{(\log x)^2}$.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.