In a deck of cards, there are kn cards numbered from 1 to n and there are k cards of each number. Now, divide this deck into k sub-decks with equal sizes. Prove that if gcd(k,n)=1, then one could always pick n cards, one from each sub-deck, such that the sum of those cards is divisible by n. combinatoricsnumber theory