来源：Mathematics of Computation, 2015, 84(293): 1389-1399.
摘要
The function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to the first k primes. We give a new computational method for calculating strong upper bounds on h(k).
科研之友
微信
新浪微博
Facebook
分享链接
