The Frobenius equation is the Diophantine equation a_1 x_1 + a_2 x_2 + ... + a_n x_n = b, where the a_i are positive integers, b is an integer, and the solutions x_i are nonnegative integers. Solution of the Frobenius equation is implemented using FrobeniusSolve[{a1, ..., an}, b]. The largest value b for which the Frobenius equation has no solution is known as the Frobenius number.

coin problem | Frobenius number | greedy algorithm | McNugget number | postage stamp problem