arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/9804025math.NT
收藏

(30 n +1)<

The Smallest Solution of ϕ(30n+1)<ϕ(30n) is ...

Greg Martin

摘要:

已知不等式<$(30 n +1)<<$(30 n)有无穷多个解,其中<$是常见的欧拉函数。然而,不存在n<20,000,000的解,并且计算解似乎涉及对具有数百位数的整数进行因子分解。在这篇笔记中,我们描述了如何在解决这类不等式时绕过对如此大的整数进行因子分解的需要,并且我们显式地计算了n(30 n +1)<n(30 n)的最小解n,一个有1116位数的数。

英文摘要:

It is known that there are infinitely many solutions to the inequality ϕ(30n+1)<ϕ(30n), where ϕis the familiar Euler totient function. However, there are no solutions with n<20,000,000, and computing a solution would seem to involve factoring integers with hundreds of digits. In this note, we describe how to get around the need to factor such large integers in addressing inequalities of this type, and we explicitly compute the smallest solution n of ϕ(30n+1)<ϕ(30n), a number with 1116 digits.

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

↑