Skip to main content
OlympiadHQ

Browse · MathNet

Print

Indija TS 2008

India 2008 number theory

Problem

Suppose , , , are positive integers such that , , are distinct and Prove that cannot be a prime. Find also the least possible value of .
Solution
Note that , , gives which has no integer solutions. Thus and . This shows that and we infer that .

If is a prime, has to be an odd prime, say . Then , so that divides . Assume , and write . If divides , it must divide either or . But then Thus cannot divide . The relation now reduces to It follows that divides . Thus or . Since , are distinct, we have . Thus if . We conclude that cannot be an odd prime.

Suppose . Substituting in the given relation, we see that . Assume , so that . We obtain Thus . Observe that and . Hence . Thus either or . But shows that forcing . Since , the other possibility is . Taking , we have and Thus . This forces giving or . But then and , giving . This is impossible for an integer .

We conclude that . For , we may take .
Final answer
d is not prime; the least possible value of d is 8.

Techniques

Prime numbersTechniques: modulo, size analysis, order analysis, inequalitiesQM-AM-GM-HM / Power Mean