arXiv (All)
open access
Diophantine approximation with primes in an arithmetic progression
Let $α\in \mathbb{R} \setminus \mathbb{Q}$, $β\in \R$, $N \in \mathbb{R}_{\ge 1}$ and $ Δ\in (0, 1/2)$. For any real $y$, let $\|y\|$ denote the distance from $y$ to the nearest integer. In the first part of this paper, we show that given two coprime integers $u, v \ge 1$, there are infinitely man
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
- Diophantine approximation by primes and Landau--Siegel zeros#1078278
- Notes on Mitsui's Prime Number Theorem with Siegel zeros#984784
- Harchev Davar on Numbers#488475
- The optimal scale in Linnik's microsquare problem for almost all integers#1083388
- On crystallization in the plane for pair potentials with an arbitrary norm#158635
Record · ID 996808
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