What is the size of the largest subset ,s , of {1,2,3...100} such that no pair of distinct elements of s has a sum divisible by 7
There are: 100 nCr 2 =4,950 possible sums
There are 4243 sums that are NOT divisible by 7, which is also the size of the largest subset
