The Chicken McNugget Theorem
GCDs and modular arithmetic build to the Frobenius result: for whole-number box sizes a,b > 1 with no common factor greater than 1, the largest number you cannot buy is ab - a - b.
GCDs and modular arithmetic build to the Frobenius result: for whole-number box sizes a,b > 1 with no common factor greater than 1, the largest number you cannot buy is ab - a - b.