Problem:
How many 3-element subsets of the set have sum of elements divisible by 4?
Solution
Solution:
Consider the elements of the sets mod 4. Then we would need to have sets of the form , , , , or . In the set there are four elements divisible by 4 and 5 elements congruent to each of . Hence the desired number is given by
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.