Indexed metadata

On a Turán's theorem for arithmetic progressions

T. Makoto Minamide, Haruka Sakai, Yoshio Tanigawa

Source record

Source: arXiv

Published: Sep 19, 2026

arXiv: 2609.22784

Open original source ↗

Source abstract

Let m1m\geq 1 be a fixed integer, aa an integer satisfying (a,m)=1(a,m)=1, and z1z\geq 1 a real parameter. Denote by ωz(n;m,a)ω_{z}(n;m,a) the number of distinct prime divisors pp of nn satisfying pa(m)p\equiv a\, (m) and pzp\leq z. We study an asymptotic behaviour of nx(ωz(n;m,a)1φ(m)loglogz)k\sum_{n\leq x}\left(ω_{z}(n;m,a)-\frac{1}{\varphi(m)}\log\log z\right)^{k} as xx\to\infty for a wide range of positive integer k2k\geq 2, where φ()\varphi(\cdot) is the Euler function. Following a method of Granville and Soundararajan we lead an asymptotic formula for the above. Also, we investigate nx(ω(n;m,a)1φ(m)loglogx)k\sum_{n\leq x}\left(ω(n;m,a)-\frac{1}{\varphi(m)}\log\log x\right)^{k}, where ω(n;m,a)ω(n;m,a) denotes the number of distinct prime divisors pp of nn such that pa(m)p\equiv a\, (m).

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On a Turán's theorem for arithmetic progressions — Mathematical Frontier Network