cclar13

#Problem 1



prime=3
div=2
count=1

while count<1000:
    while div<prime:
        if prime%div!=0:
            div=div+1
        elif prime%div==0 and prime!=div:
            count=count
            prime=prime+2
            div=2
    if prime%div==0 and prime==div:
        count=count+1
        div=2
        if count!=1000:
            prime=prime+2
        if count==1000:
            print prime


#Problem 2


from math import *

odd=3
div=2
count=1
logsum=log(2)
whichprime=int(raw_input("n="))

if whichprime==1:
    print "sum of logs: " + str(logsum)
    print "nth prime: " + str (2)
    print "ratio: " + str(logsum/2)

elif whichprime!=1:
    while count<whichprime:
        while div<odd:
            if odd%div!=0:
                div=div+1
            elif odd%div==0 and odd!=div:
                count=count
                odd=odd+2
                div=2
        if odd%div==0 and odd==div:
            count=count+1
            div=2
            logsum=logsum+log(odd)
            if count!=whichprime:
                odd=odd+2  
    if count==whichprime:
        print "sum of logs: " + str(logsum)
        print "nth prime: " + str(odd)
        print "ratio: " + str(logsum/odd)