首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Further tabulation of the Erdös-Selfridge function
Authors:Richard F Lukes  Renate Scheidler  Hugh C Williams
Institution:Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2 ; Department of Mathematical Sciences, University of Delaware, Newark, Delaware 19716 ; Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2
Abstract:For a positive integer $k$, the Erdös-Selfridge function is the least integer $g(k) > k+1$ such that all prime factors of $\binom {g(k)}{k}$ exceed $k$. This paper describes a rapid method of tabulating $g(k)$ using VLSI based sieving hardware. We investigate the number of admissible residues for each modulus in the underlying sieving problem and relate this number to the size of $g(k)$. A table of values of $g(k)$ for $135 \leq k \leq 200$ is provided.

Keywords:
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号