Ask
your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW)
9 Online
I wanted to code a variation of the 1000th prime number problem in the first problem set. I wanted to make it so that the user can choose which prime number they want. I used the following code but the program never stops. candidate = 5 count = 3 total = raw_input("Which prime number would you like to find?") while count <= total: for divisor in range(2, candidate // 2 + 1): remainder = candidate % divisor if remainder == 0: break else: count += 1 print(candidate) candidate += 1 print(candidate - 1), "is the number %d
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!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
DoltonCarlee:
what are y'all's options on S A T essays because honestly their not that bad
thereneelg:
Can someone give me a summary of article 231, The war guilt clause?? I need to explain what it is, but I can't find any shortened version of what it is and
luisaam2:
What should you do when the person you want to talk to the most is the one making
Breathless:
https://medal.tv/games/roblox/clips/nAYivIl6oXB6q9QAI?invite=cr-MSxCSk4sMTY4OTA4N
Twaylor:
I'm not that good at law can someone fact check this without bias? June 29, 2026, the Supreme Court decided Chatrie v.
Demon25:
For a hoco proposal with a cheerleader and football player, what else should be a
1 day ago
4 Replies
2 Medals
2 days ago
7 Replies
1 Medal
1 day ago
16 Replies
1 Medal
1 week ago
0 Replies
0 Medals
1 week ago
0 Replies
0 Medals
1 week ago
12 Replies
0 Medals