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

I have been working on the "find the 1000th prime" for awhile now.( several hours yesterday; before I watched lecture 3 as well as a couple hours today after watching it.) All of the practice really helped but I have ran into a problem that I haven't been able to troubleshoot myself. My current code wouldn't fit so the problem I have is with the range command. I have: "for divisors in range(1,10)" then later I check if the current number (var1) has a remainder with: "if var1%divisors!=0:" Once the code gets to that it goes straight to my else statement.

OpenStudy (anonymous):

You should make a counter

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!