For all numbers that are divisible by 3, their sums must be divisible by 3. The only two combinations of 5 numbers from the set that are divisible by 3 are:
5, 4, 3, 2, 1 --> sum = 15
5, 4, 2, 1, 0 --> sum = 12
According to the rule, all combinations of the above numbers must be divisible by 3 because their sums are divisible by 3.
In the first group, there are 5!, or 120 combinations.
In the second group, 0 cannot be in the first slot. So there are 4*4!, or 96 combinations.
96 + 120 = 216
E
Taking the GMAT Again...PhD this time!
October 2008 Score: GMAT - 750 (50 Q, 41 V)
Manhattan GMAT 1 - 11/20/11 - 750 (50 Q, 42 V)
Manhattan GMAT 2 - 12/3/11 - 780 (51 Q, 45 V)