mcnuggets_diophantine

mcnuggets_diophantine, an Octave code which finds the ways a given number N of Chicken McNuggets can be assembled, given that they are only available in packages of 6, 9, and 20.

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

mcnuggets_diophantine is available in a MATLAB version and an Octave version and a Python version.

Related Programs:

mcnuggets_diophantine_test

octave_combinatorics, an Octave code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.

Reference:

1. John D Cook,
   The Chicken McNugget Monoid,
   https://www.johndcook.com/blog/2022/10/10/mcnugget-monoid/
   10 October 2022.

Source Code

• diophantine_nd_nonnegative.m, returns all nonnegative solutions of a given Diophantine equation.
• mcnuggets_diophantine.m, finds the number of ways of getting N Chicken McNuggets;