Chicken McNuggets Number (Frobenius’s Coin-Exchange Problem)
Author: tonagaiExecutions: 5292
※ This library was created by a member. This site is not responsible for its content.
In the past, McDonald’s in the UK offered Chicken McNugget sets containing 6, 9, or 20 pieces.When buying multiple sets, the maximum number of Chicken McNuggets that cannot be obtained as the total count is the “non-Chicken McNugget number.” Replacing this with coins of various denominations yields the Frobenius coin exchange problem. We will perform the calculation using three coins.
Enter the number of nuggets in a set (or the value of a single coin) three times,
(The three numbers must be relatively prime to each other.)
Then enter the maximum value you wish to check.
If there are two sets (two types of coins), set Set 3 to 0.
(The three numbers must be relatively prime to each other.)
Then enter the maximum value you wish to check.
If there are two sets (two types of coins), set Set 3 to 0.
No customer feedback for this calculation yet.