arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.02731cs.DScs.DMcs.FLmath.COmath.NT
收藏

Sturdy和Flimsy数的计算问题

Computational Aspects of Sturdy and Flimsy Numbers

Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett, Jeffrey Shallit, Leon Witzman

摘要:

根据Stolarsky,我们说一个自然数n在基b中是脆弱的,如果n的某个正倍数在基b中的数字和小于n;否则它是坚固的。我们开发算法的方法来研究坚固和脆弱的数字。我们提供了一些判断一个数是否坚固的标准。针对基b = 2的情况,研究了检验给定数是否稳健的计算问题,给出了几种算法。我们发现两个额外的,以前未知的坚固的素数。我们开发了一种方法来确定哪些数字与一个固定的0的二进制数是脆弱的。最后,我们开发了一种方法,使我们能够估计的数量k-脆弱的数字与n位,我们提供了明确的结果为k = 3和k = 5。我们的研究结果证明了效用(和乐趣)的数论问题的算法,自动机理论的方法的基础上。

英文摘要:

Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy numbers. We provide some criteria for determining whether a number is sturdy. Focusing on the case of base b = 2, we study the computational problem of checking whether a given number is sturdy, giving several algorithms for the problem. We find two additional, previously unknown sturdy primes. We develop a method for determining which numbers with a fixed number of 0's in binary are flimsy. Finally, we develop a method that allows us to estimate the number of k-flimsy numbers with n bits, and we provide explicit results for k = 3 and k = 5. Our results demonstrate the utility (and fun) of creating algorithms for number theory problems, based on methods of automata theory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑