From a competition archive:
How many 7-subsets of $\{1,2,3,\dots,14\}$ are there, such that the sum of all the numbers in the subset is a multiple of 14?
The given answer is 246, which I have confirmed with some programming.
However, where does the answer come from? Less importantly, is there a general formula for this?
Some other questions I've read:
Number of ways to add up to a number without repetition (order does not matter)?
Number of ways to write a number $N$ as the sum of $M$ natural numbers, where order doesn't matter?
How many ways can a natural number n be expressed as a sum of one or more positive integers, taking order into account?
However, none of these have the answer that I want. I suspect there must be a neat trick using modulos or something. I've tried, but I can't quite figure it out.