Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory senior

Problem

Harold, Tanya, and Ulysses paint a very long picket fence. Harold starts with the first picket and paints every th picket; Tanya starts with the second picket and paints every th picket; and Ulysses starts with the third picket and paints every th picket. Call the positive integer paintable when the triple of positive integers results in every picket being painted exactly once. Find the sum of all the paintable integers.
Solution
Note that it is impossible for any of to be , since then each picket will have been painted one time, and then some will be painted more than once. cannot be , or that will result in painting the third picket twice. If , then may not equal anything not divisible by , and the same for . Now for fourth and fifth pickets to be painted, and must be as well. This configuration works, so is paintable. If is , then must be even. The same for , except that it can't be . Thus is and is . Since this is all , must be and must be , in order for to be paint-able. Thus is paintable. cannot be greater than , since if that were the case then the answer would be greater than , which would be impossible for the AIME. Thus the sum of all paintable numbers is .
Final answer
757