  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.
