16 Oct '05 00:23

For what positive integers m and n is it possible to construct an m-element set of positive integers such that the sum of any n of them is not divisible by n?

(Hint: Someone asked me this for n=6. I told them that m=10 is the largest for which this can be done. The generalisation follows the exact same argument I made.)

(Hint: Someone asked me this for n=6. I told them that m=10 is the largest for which this can be done. The generalisation follows the exact same argument I made.)