If an integer r has a totient which is a power of two, there are some properties which must be satisfied.

Assume
that vp (r) = q, p > 2, and q > 1. Then, it must be true that
r
r
) = pq1 (p 1)( q )
pq
p

(r) = (pq )(

This is a multiple of p and p 1, one of which is odd, so its totient cannot be a power of two. Hence, if we take the
odd part of n or n + 1 (the number found by dividing out all powers of two) we obtain a number which is of the
form 2r (p1 )(p2 ) pn . By multiplicativity of totient, the totient of this is of the form
2r1 (p1 1)(p2 1) (pn 1), so each of the primes pi must be a power of two plus one. This of course implies
r
that the primes are Fermat primes, of the form 22 + 1.
Lemma: Any integer N with a totient which is a power of two has a sum of binary digits which is a power of two.
Proof: It suffices to look at the odd part only, and show that this has a binary digit sum which is a power of two.
Fortunately, this is easy: assume that
r
Y
ki
(22 + 1)
N=
i=1

If you consider this as plugging in two to the expansion:

P (x) =

r
Y

(x2

ki

+ 1)

i=1

, youll find that its the sum of 2r monomials of the form xp , due to the uniqueness of binary representation.
Hence, the result is proven. Observe that the sum of the smallest degree and largest degree is equal to the sum of
the second smallest and second largest degree, if r > 1. This is clear.
The point here is this: if we know what a number is, its quite easy to compute the prime factorization. Say we have
the number N . Now divide out all powers of two contained in N . Consider the largest power of two 2r less than
the result, and look at the exponent. Assume that
N=

r
Y

(22

ki

+ 1)

i=1

Then it must be true that 2ki forms the binary representation of r. (this is not too hard to see)
n

Next, assume that n is not a multiple of three. First assume that n is prime. In this case, we have 22 + 1. Adding
n
one gives 22 + 2, which has a totient which is a power of two. According to the algorithm above, we factor out the
n
two and we have 22 1 + 1, so the prime factorization of this must be
0

(22 + 1)(22 + 1) (22

, so this will only work if 22

n1

+ 1) = 22 1

= 2, or when n = 1, or when the number is 5.

Now assume that the number is composite. Let the largest degree be a + b, the second largest degree be a, and the
second smallest degree be b. (the smallest degree is zero) In this case, after adding one, because n is not a multiple
of three, the smallest degree becomes one, so a + b + 1 = a + b, which is contradiction.
If 3 is a divisor, let
n=

r
Y

(22

ki

+ 1),

i=1

and let j be the smallest number which isnt an index. After adding one, the sum of the digits changes from 2r to
2r (2j 1), which must be a power of two. j cant be one, so it must be true that j = r, from which we may finish.