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

Problem Set 2 Problem 1 Can anyone explain to me what this theorem is supposed to mean? I've made the other problems in that set but I can't explain the theorem because I can't understand it. Theorem: If it is possible to buy x, x+1,…, x+5 sets of McNuggets, for some x, then it is possible to buy any number of McNuggets >= x, given that McNuggets come in 6, 9 and 20 packs.

OpenStudy (amilapsn):

Before understanding the theorem itself alone, try to do the problem before that. i. e. Show that if you can buy sets of 50. 51, 52, 53, 54, 55 McNuggets by 6, 9 and 20 packs, then you can buy sets of 56, 57, 58, 59, 60, 61, 62, 63, 64, 65 McNuggets. By proving the above, you will understand the theorem easily.

OpenStudy (anonymous):

Thank you. I had already done the problem before but when I looked at it again, I was able to explain the theorem on my own!

OpenStudy (amilapsn):

yep to do the problem you don't actually need to understand the theorem.

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!