Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 20 Online
OpenStudy (anonymous):

About the chicken mcnuggets thing, how do you do the proof on problem 2/set 2? I looked online but only for ax + by = n. I also looked here if this question had been asked and couldn't find. :(

OpenStudy (anonymous):

This is not a rigorous proof, nevertheless, I think it will give some insight. Suppose that you have packages of size 6, 9, 20. If you find six consecutive solutions starting at, then for n + 7 the solution will be the set of solution for n + 1 plus a package of size 6. For n + 8, the set of size n + 2 plus a package of size 6, etc. It is not that hard to generalize from there. At least, that's how I thought about the problem, albeit not rigorously so.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!