论文标题
用于主要差距的筛子算法
Combined Sieve Algorithm for Prime Gaps
论文作者
论文摘要
提出了一种新的组合筛子算法，其成本与一系列间隔的枚举因素数量成正比。同时处理许多（[10^4，10^7]）间隔时，该算法在传统的筛子上达到了显着的加速。加速来自时空的权衡，也是一个新颖的解决方案。在现实世界测试中，这种新算法通常会速度更快地运行10,000倍。这种更快的筛子与较高的筛分极限搭配，消除了更多的复合材料，并加速了对大质量差距的搜索30-70％。在这种新算法的开发和测试过程中，发现了两个前十名的优点质量差距。
A new Combined Sieve algorithm is presented with cost proportional to the number of enumerated factors over a series of intervals. This algorithm achieves a significant speedup, over a traditional sieve, when handling many ([10^4, 10^7]) intervals concurrently. The speedup comes from a space-time tradeoff and a novel solution to a modular equation. In real world tests, this new algorithm regularly runs 10,000x faster. This faster sieve paired with higher sieving limits eliminates more composites and accelerates the search for large prime gaps by 30-70%. During the development and testing of this new algorithm, two top-10 record merit prime gaps were discovered.
