Problem:
A set of natural numbers is called good, if for each element , does not divide the sum of the remaining numbers in . Find the maximal possible number of elements of a good set which is a subset of the set .
Solution
Solution:
Let set be the good subset of which has the maximum number of elements. We can easily see that the number does not belong to since divides all natural numbers. Based on the property of divisibility, we know that divides the sum of the remaining numbers if and only if divides the sum of all numbers in the set . If has exactly elements, then , but this set can't be good since the sum of its elements is which is divisible by . Therefore has at most elements. Now we are looking for the set whose elements do not divide their sum, so the best way to do that is making the sum of elements be a prime number. and if we remove the number , we will obtain the prime number . Hence the set is a good one. We conclude that our number is .