Functions¶

Module Contents¶

project_euler.problem_010.sol3.solution(n: int = 2000000) → int¶

Returns the sum of all the primes below n using Sieve of Eratosthenes:

The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million. Only for positive numbers.

>>> solution(1000)
76127
>>> solution(5000)
1548136
>>> solution(10000)
5736396
>>> solution(7)
10
>>> solution(7.1)
Traceback (most recent call last):
    ...
TypeError: 'float' object cannot be interpreted as an integer
>>> solution(-7)
Traceback (most recent call last):
    ...
IndexError: list assignment index out of range
>>> solution("seven")
Traceback (most recent call last):
    ...
TypeError: can only concatenate str (not "int") to str