The Frobenius coin problem calculator gives the largest amount that cannot be made with two coin values or package sizes, the number of amounts that cannot be made, the conductor from which everything is possible and whether the two values are coprime.
How the calculation works
- Enter the two values, such as coin values, stamp values or pack sizes.
- The calculator finds their greatest common divisor to check they are coprime.
- Read the Frobenius number, the count of impossible amounts and the conductor.
Example
With values of 9 and 5, the greatest common divisor is 1 (coprime flag 1), so the largest amount that cannot be made is 31. There are 16 amounts that cannot be made, and every amount from 32 on can be. The least common multiple is 45.
Why it matters
The calculator helps students, teachers, puzzle fans, cashiers and planners who want to know which totals can be paid with two coin or stamp values, or which quantities can be ordered with two pack sizes, and why large totals always work.
Good to know
Use whole numbers from 2 to 600. If the values are not coprime, divide both by their greatest common divisor first and treat the problem in the new units, since only multiples of the divisor can be made. The formula is for exactly two values, so for three or more you need a computer search. The number of impossible amounts does not include zero, which is always possible with no coins. For a quick check by hand, list the multiples of the smaller value and add the larger one repeatedly: the first run of consecutive possible amounts as long as the smaller value marks the point from which everything works.
Related tools
The GCD and LCM calculator finds divisors and multiples, the coin jar calculator counts coins, the prime number theorem calculator estimates primes and the polygonal numbers calculator explores number patterns.