python寻找1～n以内（包括n）所有素数

python">def find_prime(n):
    L = list(range(2,n + 1))
    m = 0
    while m < len(L):
        n = m + 1
        while n < len(L):
            if L[n]%L[m] == 0:
                del L[n]
            n = n + 1
        m = m + 1
    return L
print(find_prime(n))

标签：python