This morning my younger son had some trouble with a problem on an old MOEMs test that is similar to the famous Chicken McNugget problem. Similar enough, actually, that I decided to put off our second day of divisibility rules until tomorrow in order to spend our time today talking about this problem.

Given that we just finished up a section on modular arithmetic, there is a bit of a connection to what we’ve been studying, but I mostly just wanted to talk McNuggets!

First up was talking through his approach to the MOEMs problem this morning. In this video we do get to the answer by checking every number until we get a bunch in a row. I wanted to let him talk through this approach just to show him that he really could solve this problem on his own.

Next up was an approach to the problem that was a little more systematic and also brought in some ideas about pattern recognition. When we write out our grid of numbers my younger son notices that above 13 you can just keep adding 3’s to one of the rows and get all of the remaining numbers.

The last part of talking about the MOEMs problem was bringing in modular arithmetic. The ideas here help us see why we could just keep adding 3’s in the last step:

Finally, the punchline – the Chicken McNugget problem. This one is a tiny bit more difficult because there are 3 sizes rather than just the 2 from the MOEMs problem, but we do manage to get to the end using basically the same ideas we talked about earlier in the project.

So, an accidentally fun morning with one of my all time favorite little math puzzles ðŸ™‚