def main(): start = time.perf_counter() p = primes.sieve8(20000000) resultat = 0 for i in p: pi = i while pi <= 20000000: resultat += i * (20000000//pi - 15000000//pi - (20000000 - 15000000)//pi) pi *= i print(resultat) print('temps d execution', time.perf_counter() - start, 'sec')
def main(): start = time.perf_counter() p = primes.sieve8(20000000) resultat = 0 for i in p: pi = i while pi <= 20000000: resultat += i * (20000000 // pi - 15000000 // pi - (20000000 - 15000000) // pi) pi *= i print(resultat) print('temps d\'exécution', time.perf_counter() - start, 'sec')
def init_sieve(self): self.sieve = primes.sieve8(self.n)
def init_sieve(self): n = primes.upper_bound_prime(self.n) self.sieve = primes.sieve8(n)
def __init__(self): self.primes_table = primes.sieve8(10**9)
def __init__(self, n, d): self.n = n self.d = d self.list_primes = primes.sieve8(int(math.sqrt(n))+1) # list of primes p such that p**2 <= n self.list_primes_candidates = [] # list of tuples (p, i) such that d divides sigma(p^i) self.res = 0 # compte les multiples des premiers qui conviennent puis enleve les doublons
def __init__(self, n): self.n = n self.primes_set = set(primes.sieve8(self.n)) self.res = 0