Imagine that pieces of chicken are sold in groups of 3 and groups of 7. What number of pieces of chicken are achievable as non-negative integer combinations of 3 and 7, and how many numbers are impossible to achieve? This is the Frobenius coin problem. When there are two coprime denominations, the answer is called Sylvester’s theorem or the Chicken McNugget theorem.