奇奇数在丰度边界上的搜索
Searching on the boundary of abundance for odd weird numbers
摘要:
奇异数是非伪完全数的丰富数。自从奇怪数被引入以来,奇怪数的存在性一直是一个公开的问题。在这项工作中,我们描述了我们的计算努力,以寻找奇数怪异的数字,这表明他们不存在$10^{21}$。我们还搜索了高达$10^{28}$的丰度低于$10^{14}$的数字,但没有结果。我们的方法,以加快搜索可以被视为反向搜索在组合优化领域的应用,并可能是有用的其他类似的追求自然数的特殊性质,关键取决于他们的因式分解。
英文摘要:
Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which shows their non-existence up to $10^{21}$. We also searched up to $10^{28}$ for numbers with an abundance below $10^{14}$, to no avail. Our approach to speed up the search can be viewed as an application of reverse search in the domain of combinatorial optimization, and may be useful for other similar quest for natural numbers with special properties that depend crucially on their factorization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。