Having difficulty with PSet1 Prob2. Here is what I have thus far...
from math import *
prime_poss = 2
sum = 0
n = int(raw_input("Enter a number: "))
while prime_poss < n:
if prime_poss%2 != 0:
for divisor in range (2, (prime_poss/2)):
if prime_poss%divisor != 0:
logprime = log(prime_poss)
print logprime
sum = logprime + sum
prime_poss += 1
else:
prime_poss += 1
print sum
Ideas?

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!

Technically, the square root of the number

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.