Jacobsthal函数计算的数学概念
Algorithmic concepts for the computation of Jacobsthal's function
摘要：
在过去的几十年里，Jacobsthal函数在各种背景下引起了人们的兴趣。我们回顾了几个算法思想的Jacobsthal函数的计算素数，并讨论其实用性的计算工作量。相应的函数值是为最多251个素数计算的。除了结果，包括以前未知的数据，我们在辅助文件中提供了适当的最大长度的所有序列的详尽列表。
英文摘要：
The Jacobsthal function has aroused interest in various contexts in the past decades. We review several algorithmic ideas for the computation of Jacobsthal's function for primorial numbers and discuss their practicability regarding computational effort. The respective function values were computed for primes up to 251. In addition to the results including previously unknown data, we provide exhaustive lists of all sequences of the appropriate maximum lengths in ancillary files.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
