arXiv (All)
open access
Bounded intervals containing a given number of primes
Let $m$ be a non-negative integer and $f(x)$ a positive, non-decreasing function satisfying certain conditions. We give an explicit lower bound for the number of integers $n\leq x$ such that $\#([n, n+f(n)] \cap \mathbb{P})=m$ for sufficiently large $x$, where $\mathbb{P}$ denotes the set of prime n
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
- Reducibility of $rx^m+p^e f(x)$ for Large Primes $p$#1077522
- Uniform bounds on periodic points of polynomials with good reduction#1122416
- A lattice family with kissing numbers $τ(\mathcal{L}_n) \ge e^{2 \sqrt{n}}$#1156454
- Uniform estimate of Lang-Weil type for counting points of schemes over finite rings#1157019
- Asymptotic counting of integers with prime factors $p_{r^a s^b}$#1014028
Record · ID 1012600
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