I've got everything working on ps1, except my program doesn't find 2 as a prime. My brain is spent - can someone explain what I'm doing wrong?
primesFound = 1
testMe = 1
while primesFound < 1000:
for divisor in range(2,testMe):
remainder = testMe % divisor
if testMe%2 == 0: break
if remainder == 0:
prime = False
break
if divisor == testMe-1:
print str(testMe) + " is a prime number."
primesFound = primesFound + 1
testMe = testMe + 1

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Can you repost your code using dpaste.com. or attach them?

Actually I got it working... :)
Should I still post it?

Looking for something else?

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

## More answers

Looking for something else?

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