Unbounded logarithmic limsup in Erdős Problem 684 via shifted carry scheduling
Ji Ho Bae
备注:
13 pages. v3: complete rewrite. The v1-v2 argument, which relied on an unjustified weighted extension of Timofeev's method, is withdrawn and replaced by an independent unconditional proof of the stronger quantitative bound. The theorem is formally verified in Lean 4 (Mathlib + PrimeNumberTheoremAnd), with no hypotheses: https://github.com/jidodat/erdos684-lean (tag v3-arxiv)
For $1\leq k\leq n$, let $u(n,k)=\prod_{p\leq k}p^{ν_p\binom nk}$ and $f(n)=\min\{1\leq k\leq n:u(n,k)>n^2\}$. The minimum is interpreted as $+\infty$ if the set is empty. Here $ν_p(m)$ denotes the exponent of the prime $p$ in $m$. Erdős Problem 684 asks for bounds on $f(n)$. We prove $\limsup_{n\to\infty} \frac{f(n)}{\log n}\frac{\log\log\log n}{\log\log n}\geq\frac12$. In particular, $\limsup_{n\to\infty}f(n)/\log n=\infty$, so no uniform estimate $f(n)=O(\log n)$ is possible. The proof constructs integers $n=tL_M-h-1$, where $L_M=\operatorname{lcm}(1,\ldots,M)$. Product-cell coding yields simultaneous two-sided approximations to $tL_M$ modulo every prime in $(M,K]$. Writing $n+1=tL_M-h$, the shift by $h$ folds both signs into the same one-sided carry region. The carries at levels at most $M$ are bounded by $\log\binom{h+k}{h}$. For the prime powers above $K$, a truncated CRT witness has modulus below the search range; exponential weighting then gives an exponentially small exceptional set. An elementary anchored-fibre lemma selects a multiplier satisfying both requirements. Together, these ingredients prove the stated bound unconditionally. The theorem has been formally verified in Lean 4 with Mathlib.
Irrationality of rapidly converging series: a problem of Erdős and Graham
Queens’ College, University of Cambridge(剑桥大学皇后学院);Department of Mathematical Science, Seoul National University(首尔大学数学科学系);School of Mathematics, Korea Institute for Advanced Study (KIAS)(韩国高等科学研究院数学学院);University of Zagreb Faculty of Science, Department of Mathematics(萨格勒布大学理学院数学系);Department of Mathematics, Stanford University(斯坦福大学数学系)