Given 12 consecutive integers, how many ways can three of these integers be selected to give a sum which divides by 4. Disclaimer: A lot of points to be given, Full explanation required. Not only answer. Remember the sum of the number must be divisible by 4. I think modular arithmetic is the way to solve it, but who knows???