fuxino/project-euler-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix sieve

Browse Source
This commit is contained in:
daniele 2023-06-08 11:44:35 +02:00
parent a24f670f16
commit 419ba8d44d
Signed by: fuxino
GPG Key ID: 981A2B2A3BBF5514
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Python/projecteuler.py
View File

@ -73,7 +73,7 @@ def lcmm(values, n):
# Function implementing the Sieve or Eratosthenes to generate primes up to a certain number. # Function implementing the Sieve or Eratosthenes to generate primes up to a certain number.
def sieve(n): def sieve(n):
primes = [1] * n primes = [1] * (n + 1)
# 0 and 1 are not prime, 2 and 3 are prime. # 0 and 1 are not prime, 2 and 3 are prime.
primes[0] = 0 primes[0] = 0
@ -86,7 +86,7 @@ def sieve(n):
# If i is prime, all multiples of i smaller than i*i have already been crossed out. # If i is prime, all multiples of i smaller than i*i have already been crossed out.
# if i=sqrt(n), all multiples of i up to n (the target) have been crossed out. So # if i=sqrt(n), all multiples of i up to n (the target) have been crossed out. So
# there is no need check i>sqrt(n). # there is no need check i>sqrt(n).
limit = floor(sqrt(n)) limit = ceil(sqrt(n + 1))
for i in range(3, limit, 2): for i in range(3, limit, 2):
# Find the next number not crossed out, which is prime. # Find the next number not crossed out, which is prime.