Problem:
Let be a natural number such that , for some natural numbers . Prove that
where 's, 's, 's are all nonzero integers. Further, if does not divide at least one of , prove that can be expressed in the form , where are natural numbers none of which is divisible by .
Solution
Solution:
It can be easily seen that
Thus we can take , and . Suppose does not divide . Then does divide at least one of ; say does not divide . Note that each of , and is either divisible by or none of them is divisible by , as the difference of any two sums is always divisible by . If does not divide , then we have the required representation. If divides , then does not divide . On the other hand, we also note that
where , and . Since and does not divide , it follows that does not divide as well. Similarly, we conclude that does not divide .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.