mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-01-18 16:27:02 +00:00
Improve prime_check
in math modules (#6044)
* improved prime_check * updating DIRECTORY.md * included suggested changes * updating DIRECTORY.md Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
parent
f7c58e4c4b
commit
dcc387631d
|
@ -37,12 +37,15 @@ def is_prime(number: int) -> bool:
|
||||||
if 1 < number < 4:
|
if 1 < number < 4:
|
||||||
# 2 and 3 are primes
|
# 2 and 3 are primes
|
||||||
return True
|
return True
|
||||||
elif number < 2 or not number % 2:
|
elif number < 2 or number % 2 == 0 or number % 3 == 0:
|
||||||
# Negatives, 0, 1 and all even numbers are not primes
|
# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
|
||||||
return False
|
return False
|
||||||
|
|
||||||
odd_numbers = range(3, int(math.sqrt(number) + 1), 2)
|
# All primes number are in format of 6k +/- 1
|
||||||
return not any(not number % i for i in odd_numbers)
|
for i in range(5, int(math.sqrt(number) + 1), 6):
|
||||||
|
if number % i == 0 or number % (i + 2) == 0:
|
||||||
|
return False
|
||||||
|
return True
|
||||||
|
|
||||||
|
|
||||||
class Test(unittest.TestCase):
|
class Test(unittest.TestCase):
|
||||||
|
|
Loading…
Reference in New Issue
Block a user