I'm totally stuck as to *why* there are solutions for n >= x in problem set 2 problem 2. My code for the rest of the problem set is working fine, though. Any ideas?
MIT 6.00 Intro Computer Science (OCW)
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
Please post your code so we can see it, either by attaching or using dpaste.com.
The code works fine, as far as I can tell, though. But I'm not seeing the mathematical concept behind problem #1.
lets say you can find 6 consecutive numbers of nuggets that you can buy with different combinations of 6, 9 and 20:
x, x+1, x+2, x+3, x+4, x+5
can you buy x+6 ? what would you have to do?
can you buy x+7 (or x+1 + 6)? what would you have to do?
can you buy x+11?
can you buy x+12?
don't know if its an actual mathematical concept - rather inductive or deductive reasoning lets you understand the theorem is true/valid.
a mathemagician could probably write an equation.