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$.
UVA Department of Mathematics(弗吉尼亚大学数学系);LIRMM, Univ Montpellier, CNRS(蒙彼利埃大学LIRMM实验室);MIT Department of Mathematics(麻省理工学院数学系);UCLA Department of Mathematics(加州大学洛杉矶分校数学系);Google(谷歌)
我们考虑一个问题,首先提出了马勒和Popken在1953年,后来发展的Coppersmith,Erdensys,盖伊,Isbell,Selfridge,和其他人。令$f(n)$为$n \in \mathbb{Z^{+}}$的复杂度,其中$f(n)$定义为表示$n$所需的最少数量的$1$,以及任意数量的$+$、$*$和括号.已经开发了几种算法来计算高达$n$的所有整数的复杂度。目前,已知最快的算法是$\mathcal{O}(n^{1.230175})$,由J. Arias de Reyna和J. van de Lune在2014年给出。该算法利用Guy给出的递归定义,并迭代通过$d \ |\ n$的乘积$f(d) + f\left(\frac{n}{d}\right)$和$a$的求和$f(a) + f(n - a)$,直到$n$的某个函数。速率限制因素是迭代求和。我们讨论了潜在的改进,该算法通过一种方法,提供了一个强大的统一的上限的数目,必须计算几乎所有的$n$的被加数。我们还开发了代码来运行J. Arias de Reyna和J. van de Lune的分析,从而将$\mathcal{O}(n^{1.230175})$的运行时间减少到$\mathcal{O}(n^{1.222911236})$。我们所有的代码都可以在网上找到:https://github.com/kcordwel…