arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.23784math.NTmath.CO
收藏

埃德华兹问题684中的无界对数limsup

Unbounded logarithmic limsup in Erdős Problem 684 via shifted carry scheduling

Ji Ho Bae

AI总结:

本文通过短乘数构造证明了埃德华兹问题684中f(n)的上界为无穷大,推翻了f(n)≤log n的预期上界,并给出了f(n)严格大于log n的顺序界。

摘要:

对于0≤k≤n,将C(n,k)=uv分解为u和v,其中u的素因子不超过k,v的素因子超过k,令f(n)为最小的k使得u>n²;埃德华兹问题684要求对f(n)进行界限研究。我们解决了该问题的顺序级。通过短乘数构造n_M=tL_M-1,其中L_M=lcm(1,…,M)且t是大小为exp(o(M))的乘数,从傅里叶筛中提取,我们证明对于每个固定的C>1,存在整数n使得f(n)>(C-o(1))log n,因此limsup_{n→∞}f(n)/log n=∞。我们推翻了广泛预期的上界f(n)≪log n,并证明f(n)的顺序严格高于log n无限次发生。已知通过Alexeev等人(arXiv:2603.29961)的构造,f(n)的匹配多项对数上界为f(n)≪(log n)²。该乘数筛的缩减到二进制固定-Ω算术级数估计,包括Q_M=M!/L_M的盒子参数化、局部调和高度上限以及精确-a乘积壳提取,是新的。所需的估计使用Timofeev的均值在级数框架以及Burgess基于模p的节省在相关素数带中。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑