If is a positive integer, let be the smallest positive number for which is divisible by . Then determine the sum of all positive integers satisfying:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Suppose n is such an integer. Since 3 ∣ 2 n , we need 3 ∣ n . So let n = 3 k . Note that 3 k ∣ ( 2 k ) ! but 3 k ∤ k ! . This is only possible if k ≤ 3 , since otherwise both 3 and k appear separately in k ! . So n = 3 , 6 , 9 are the only possibilities. It's easy to check that n = 9 is the only one that works, so the answer is 9 .