anonymous
  • anonymous
I could not figure out how to complete problem 2 of assignment 2 in the 6.00 class. I watched lectures 1-4 and was still clueless. with help I was able to finally answer problem one which is to write code to find the 1000th prime. I ended up looking for the answer to see what I was supposed to do, yet the answer that I got doesn't work. It says log isn't defined, can someone give me a web address to a place where the correct answer is so I can see what it should be. Thanks.
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 :)
SOLVED
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.
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
What problem set are you talking about 2 or 1? PS 1 is the problem set about prime numbers.
anonymous
  • anonymous
http://pythonism.wordpress.com/2008/05/04/looking-at-prime-numbers-in-python/
anonymous
  • anonymous
the log function is in the math module which needs to be imported http://dpaste.com/694206/

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
prob set 1 part 2

Looking for something else?

Not the answer you are looking for? Search for more explanations.