arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.08559math.NTcs.DS
收藏

Erdens-Selfridge函数的算法和估计(正在进行中)

An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress)

Brianna Sorenson, Jonathan P Sorenson, Jonathan Webster

摘要:

令$p(n)$表示整数$n$的最小素因子。将函数$g(k)$定义为最小整数$>k+1$,使得$p(\binom{g(k)}{k})>k$。我们有PDMATHAMR和$g(3)=g(4)=7$。在本文中,我们提出了以下新的结果Erdens-Selfridge函数$g(k)$:我们提出了一个新的算法来计算$g(k)$的值,并使用它来验证以前的工作和计算新的$g(k)$的值,我们目前的限制是$$ g(323)= 1\ 69829\ 77104\ 46041\ 21145\ 63251\ 22499. $$我们定义了一个新的函数$\hat{g}(k)$,并在我们的均匀分布启发式的假设下,我们表明,$$ \log g(k) = \log \hat{g}(k) + O(\log k) $$具有高的“概率”。我们还提供了计算证据来支持我们的主张,$\hat{g}(k)$估计$g(k)$合理,以及在实践中。有几个开放的行为$g(k)$,我们能够证明$\hat{g}(k)$,即$$ 0.525\ldots +o(1) \quad \le \quad \frac{\log \hat{g}(k)}{k/\log k} \quad \le \quad 1+o(1), $$和$$ \limsup_{k\rightarrow\infty} \frac{\hat{g}(k+1)}{\hat{g}(k)}=\infty.$$让$G(x,k)$计数的整数$n\le x$,使$p(\binom{n}{k})>k$。无条件地证明了对于大的$x$,$G(x,k)$渐近于$x/\hat{g}(k)$ .最后,我们证明了我们的新算法的运行时间最多为$g(k) \exp[ -c (k\log\log k) /(\log k)^2 (1+o(1))]$的常数$c>0$。

英文摘要:

Let $p(n)$ denote the smallest prime divisor of the integer $n$. Define the function $g(k)$ to be the smallest integer $>k+1$ such that $p(\binom{g(k)}{k})>k$. So we have $g(2)=6$ and $g(3)=g(4)=7$. In this paper we present the following new results on the Erdős-Selfridge function $g(k)$: We present a new algorithm to compute the value of $g(k)$, and use it to both verify previous work and compute new values of $g(k)$, with our current limit being $$ g(323)= 1\ 69829\ 77104\ 46041\ 21145\ 63251\ 22499. $$ We define a new function $\hat{g}(k)$, and under the assumption of our Uniform Distribution Heuristic we show that $$ \log g(k) = \log \hat{g}(k) + O(\log k) $$ with high "probability". We also provide computational evidence to support our claim that $\hat{g}(k)$ estimates $g(k)$ reasonably well in practice. There are several open conjectures on the behavior of $g(k)$ which we are able to prove for $\hat{g}(k)$, namely that $$ 0.525\ldots +o(1) \quad \le \quad \frac{\log \hat{g}(k)}{k/\log k} \quad \le \quad 1+o(1), $$ and that $$ \limsup_{k\rightarrow\infty} \frac{\hat{g}(k+1)}{\hat{g}(k)}=\infty.$$ Let $G(x,k)$ count the number of integers $n\le x$ such that $p(\binom{n}{k})>k$. Unconditionally, we prove that for large $x$, $G(x,k)$ is asymptotic to $x/\hat{g}(k)$. And finally, we show that the running time of our new algorithm is at most $g(k) \exp[ -c (k\log\log k) /(\log k)^2 (1+o(1))]$ for a constant $c>0$.

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

↑