解析数论导轮中的数学实验(python)

前置代码

import math

def isprime(n):
    sqrtn = math.ceil(math.sqrt(n))
    for i in range(2, int(sqrtn)):
        if n % i == 0:
            return False
    return True

def primes(n):
    ret = [2]
    for i in range(3, n+1):
        if isprime(i):
            ret.append(i)
    return ret
print("calc primes")
ps = primes(100000)
print("calc primes end")

第2章 Arithmetical Functions and Dirichlet Multiplication

这里写代码片

第3章 Averages of Arithmetical Functions

3.11

for i in x:
    lx = 0
    for j in range(1,i+1):
        lx = lx + math.log(j)

    mx = 0
    for j in range(1,i+1):
        mx = mx + lambdaFunc(j)*math.floor(i/j)
    print "info", i, lx, mx

第4章 Some Elementary Theorems on the Distribuction of Prime Numbers