#This program finds the 1000th prime number
 
primeTest = 3 #Candidate to be tested for primeness. Starts with the second prime number.
primesCounter = 2 

while primesCounter < 1000:
    primeTest += 2 #only test odd numbers for primeness (even numbers are divisible by 2)
    for divisor in range(3, primeTest/2,2): #only divide by odd numbers as no even number can test true for the following test
        if  primeTest % divisor == 0: #Check if primeTest has an integer divisor beteween 2 and primeTest/2 with no modulo 
            break #Stop Checking, number is not prime
    else:
	#the number is prime, count it
	primesCounter += 1
        print 'I have found', primesCounter, 'prime numbers so far, and the last one was', primeTest