Skip to main content
OlympiadHQ

Browse · MathNet

Print

Indija TS 2008

India 2008 number theory

Problem

Suppose is a composite number such that divides , where denotes Euler's totient function. Show that has at least four distinct prime factors.
Solution
Suppose has only one prime factor. Then for some and prime . Then divides , which is impossible since . Thus has at least two prime factors.

Suppose , where are primes, and . Here and . Thus implies that and divides . This implies that and , forcing .

If has three distinct prime factors, say , we see as in the earlier case and divides . Taking and , we see that is an integer. We also observe that no prime can be even. (Otherwise is odd whereas one of is even.) Thus we may assume , so that and . Thus Thus and hence If , we have and . In this case, Thus and . We obtain This may be written in the form . We thus get . In turn, we have and . But then is not a prime. Thus the number of distinct prime factors of is more than 3.

Techniques

φ (Euler's totient)Factorization techniques