• 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.
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert
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.
  • chestercat
I got my questions answered at in under 10 minutes. Go to now for free help!
  • anonymous
You should make a counter

Looking for something else?

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