Skip to content

Improve Project Euler problem 058 solution 1 #4782

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Oct 25, 2021
Merged

Improve Project Euler problem 058 solution 1 #4782

Changes from 3 commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
0c9b1b8
Fix typo
MaximSmolskiy Sep 25, 2021
72407e2
Improve solution
MaximSmolskiy Sep 25, 2021
06376bb
Retest
MaximSmolskiy Oct 16, 2021
dd2147c
Replace n with number
MaximSmolskiy Oct 22, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 9 additions & 7 deletions project_euler/problem_058/sol1.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -33,26 +33,28 @@
count of current primes.

"""
from math import isqrt


def isprime(d: int) -> int:
def isprime(n: int) -> int:
"""
returns whether the given digit is prime or not
returns whether the given number is prime or not
>>> isprime(1)
0
>>> isprime(17)
1
>>> isprime(10000)
0
"""
if d == 1:
if n == 1:
return 0

i = 2
while i * i <= d:
if d % i == 0:
if n % 2 == 0 and n > 2:
return 0

for i in range(3, isqrt(n) + 1, 2):
if n % i == 0:
return 0
i = i + 1
return 1


Expand Down