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

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

1998-04-06

arxiv.org/abs/math/9804025v1

Amer. Math. Monthly 106 (1999), no. 5, 449-451.

Mathematics

Number Theory

3 pages, to appear in the Amer. Math. Monthly

Scientific paper

It is known that there are infinitely many solutions to the inequality \phi(30n+1)<\phi(30n), where \phi 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 \phi(30n+1)<\phi(30n), a number with 1116 digits.

Affiliated with

Also associated with

No associations

Rating

The Smallest Solution of φ(30n+1)<φ(30n) is ... does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Smallest Solution of φ(30n+1)<φ(30n) is ..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Smallest Solution of φ(30n+1)<φ(30n) is ... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-619504