Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 70 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 212 tok/s Pro
GPT OSS 120B 466 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Non-CM elliptic curves with infinitely many almost prime Frobenius traces (2207.08322v1)

Published 18 Jul 2022 in math.NT

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}$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube