arXiv (All)
open access
On a Turán's theorem for arithmetic progressions
Let $m\geq 1$ be a fixed integer, $a$ an integer satisfying $(a,m)=1$, and $z\geq 1$ a real parameter. Denote by $ω_{z}(n;m,a)$ the number of distinct prime divisors $p$ of $n$ satisfying $p\equiv a\, (m)$ and $p\leq z$. We study an asymptotic behaviour of $\sum_{n\leq x}\left(ω_{z}(n;m,a)-\frac{1}{
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
- Asymptotic counting of integers with prime factors $p_{r^a s^b}$#1014028
- On the largest prime factors less than $y$ of consecutive shifted primes#1109216
- A finite arithmetic form of Robin's inequality and its equivalence to the Riemann hypothesis#1062711
- A lattice family with kissing constant $τ(\mathcal{L}_n) \ge e^{\sqrt{n}}$#1071382
- Distinct exponents in the prime factorization#1051834
Record · ID 1037467
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