def nthPrime( x ):
index = 3
x = x-2 # automatically count 2 and 3
while x > 0:
index = index + 2
if largestPrimeFactor.isPrime(index):
prime = index
#print prime
x = x-1
print prime
def summationOfPrimes( x ):
runningSum = 2
lastPrime = 3
i = 3
while i < x:
if largestPrimeFactor.isPrime( i ):
runningSum = runningSum + i
lastPrime = i
print i
i = i+2
print runningSum
