arXiv (All)
open access
A prime plus a square: A conditional 11/20 upper bound
Let $E_\square(N)$ count the positive integers at most $N$ that cannot be expressed as a prime plus a nonnegative integer square. Assuming that every nontrivial zero of every primitive Dirichlet $L$-function has real part at most $7/8$, we prove $E_\square(N)\ll_\eps N^{11/20+\eps}$ for every $\eps>
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The optimal scale in Linnik's microsquare problem for almost all integers#1083388
- Prime Plus a Non-Square-Free Integer: An Elementary Approach#1084641
- Selberg sieve weights and sign changes of Kloosterman sums. II. Square-free moduli with at most four prime factors#1050438
- On the exponential sum over squarefree integers#926820
- Improved bounds for Szpiro's conjecture#1123755
Record · ID 1357310
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive