It is already known that the totient function is bounded as follows:

So, given an arbitrary positive integer , for all . So the highest number satisfying must still be less than . Since there is such an upper bound, the total number of integers n satisfying this equality is finite.