For the limsup version of the 2-adic Littlewood conjecture, the paper proves the uniform bound must be at least 5; for the max version, a computer-assisted search raises the bound to 15.
Estimating lower limit in the $p$-adic Littlewood conjecture
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We verify that $\liminf_{q\to\infty} q\cdot |q|_p\cdot ||qx||<\epsilon$ for all real $x$, small primes $p$ and relatively small $\epsilon$. This result supports the famous $p$-adic Littlewood conjecture which states that the above lower limit is equal to 0 for all $x\in\mathbb{R}$. In particular, the result is established for $p=2$ with $\epsilon=1/25$. For $3\le p\le 29$, the upper bounds for $\epsilon$ vary, but they are always at most $1/10$.
citation-role summary
background 1
citation-polarity summary
fields
math.NT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Some Bounds Related to the $2$-adic Littlewood Conjecture
For the limsup version of the 2-adic Littlewood conjecture, the paper proves the uniform bound must be at least 5; for the max version, a computer-assisted search raises the bound to 15.