科研速览 · Science Skim继续刷下去 · Keep skimming →
◇ arXiv2026-09-08· math.NT

On the cardinality of the exception set in Littlewood's discrete conjecture

A. A. Illarionov

原始摘要(英文原文)· Original abstract
Let $p$ be a prime, $d\ge 2$, $H\in [1,p)$, and $\ln\ln p = o(\ln H)$. We prove that $$ \min_{1\le n \le H} n \left\|\frac{a_1 n}{p}\right\|\ldots \left\|\frac{a_d n}{p}\right\| \approx \frac{1}{(\ln p)^{d-1} \ln H} $$ for "almost all" $a \in ({\Bbb Z} / p{\Bbb Z})^d$.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

On the cardinality of the exception set in Littlewood's discrete conjecture — 科研速览 Science Skim