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

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?

OpenStudy (anonymous):

Please post your code so we can see it, either by attaching or using dpaste.com.

OpenStudy (anonymous):

ps2a.py http://dpaste.com/hold/530178/ ps2b.py http://dpaste.com/hold/530179/ The code works fine, as far as I can tell, though. But I'm not seeing the mathematical concept behind problem #1.

OpenStudy (anonymous):

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.

OpenStudy (anonymous):

\[\theta \Delta \sqrt[\tan^{-1} ]{?}\]

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!