The Smallest Solution of ϕ(30n+1)<ϕ(30n) is ...
| dc.creator | Martin, Greg | |
| dc.date | 1998-04-06 | |
| dc.date.accessioned | 2026-07-07T05:24:19Z | |
| dc.date.available | 2026-07-07T05:24:19Z | |
| dc.description | 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. | |
| dc.description | 3 pages, to appear in the Amer. Math. Monthly | |
| dc.identifier | https://arxiv.org/abs/math/9804025 | |
| dc.identifier | http://arxiv.org/abs/math/9804025 | |
| dc.identifier | Amer. Math. Monthly 106 (1999), no. 5, 449-451. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76792 | |
| dc.subject | Number Theory | |
| dc.subject | 11A25 | |
| dc.title | The Smallest Solution of ϕ(30n+1)<ϕ(30n) is ... | |
| dc.type | text |