View difference between Paste ID: 2A9v4qzr and EseTNw2K

-#compute n prime numbers
+#sum the log of primes
-#James Tuvell
+
 import math
 
 def is_prime(number):
 	"""Check positive integer for primeness
 	It will return false for any none positive integer
 	or the number 0
 	"""
 	count = 2
 
 	if number <= 1:
 		return False
 	if number == 2:
 		return True
 
 	while count <= math.sqrt(number):
 		if number % count == 0:
 			return False
 		count = count + 1
-		count = count + 1
+
-
+
 #==== End of Defs ==========
 
 n = 40
 logsum = 0
-testnum=2
+
 for i in range(2,n):
-for i in range(1000):
+
-	primeflag=False
+	if is_prime(i):
-	while primeflag != True:
+		logsum = logsum + math.log(i)
-		primeflag = is_prime(testnum)
+		print i,logsum,logsum/n
-		testnum=testnum+1
+
-	print testnum-1,
+print "The sum of the primes from 2 to ",n," is: ", logsum
 print "in the ratio ",logsum ,":",n ,"is equal to:", logsum/n