Sum of log(primes) to n

#sum the log of primes

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

    return True
#==== End of Defs ==========

n = 40
logsum = 0

for i in range(2,n):

    if is_prime(i):
        logsum = logsum + math.log(i)
        print i,logsum,logsum/n

print "The sum of the primes from 2 to ",n," is: ", logsum
print "in the ratio ",logsum ,":",n ,"is equal to:", logsum/n