primesLeft = 999 #1000 primes to find, excluding 2 (only even)
trialNum = 3 #not counting 1, 3 is our second of 1000
while primesLeft>0: #until we find our 1000th prime
    for divisorNum in range (2, trialNum/2):#divide by all #s btwn 1 and half of trialNum
        if (trialNum % divisorNum) == 0: #if trial/divisor has no rem (divides perfectly)
            print trialNum,"is not prime", divisorNum, "is a factor"
            trialNum = trialNum+2
        else: #if trial/divisor has rem
            primesLeft = primesLeft - 1
            print trialNum,"is prime. primesLeft ==", primesLeft
            trialNum = trialNum + 2
print "1000th prime is ",trialNum-2

cHJpbWVzTGVmdCA9IDk5OSAjMTAwMCBwcmltZXMgdG8gZmluZCwgZXhjbHVkaW5nIDIgKG9ubHkgZXZlbikKdHJpYWxOdW0gPSAzICNub3QgY291bnRpbmcgMSwgMyBpcyBvdXIgc2Vjb25kIG9mIDEwMDAKd2hpbGUgcHJpbWVzTGVmdD4wOiAjdW50aWwgd2UgZmluZCBvdXIgMTAwMHRoIHByaW1lCiAgICBmb3IgZGl2aXNvck51bSBpbiByYW5nZSAoMiwgdHJpYWxOdW0vMik6I2RpdmlkZSBieSBhbGwgI3MgYnR3biAxIGFuZCBoYWxmIG9mIHRyaWFsTnVtCiAgICAgICAgaWYgKHRyaWFsTnVtICUgZGl2aXNvck51bSkgPT0gMDogI2lmIHRyaWFsL2Rpdmlzb3IgaGFzIG5vIHJlbSAoZGl2aWRlcyBwZXJmZWN0bHkpCiAgICAgICAgICAgIHByaW50IHRyaWFsTnVtLCJpcyBub3QgcHJpbWUiLCBkaXZpc29yTnVtLCAiaXMgYSBmYWN0b3IiCiAgICAgICAgICAgIHRyaWFsTnVtID0gdHJpYWxOdW0rMgogICAgICAgIGVsc2U6ICNpZiB0cmlhbC9kaXZpc29yIGhhcyByZW0KICAgICAgICAgICAgcHJpbWVzTGVmdCA9IHByaW1lc0xlZnQgLSAxCiAgICAgICAgICAgIHByaW50IHRyaWFsTnVtLCJpcyBwcmltZS4gcHJpbWVzTGVmdCA9PSIsIHByaW1lc0xlZnQKICAgICAgICAgICAgdHJpYWxOdW0gPSB0cmlhbE51bSArIDIKcHJpbnQgIjEwMDB0aCBwcmltZSBpcyAiLHRyaWFsTnVtLTI=