We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 2040757 commit 1305e74Copy full SHA for 1305e74
maths/PrimeCheck.py
@@ -1,8 +1,8 @@
1
import math
2
def primeCheck(number):
3
- if n % 2 == 0 and n > 2:
+ if number % 2 == 0 and number > 2:
4
return False
5
- return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))
+ return all(number % i for i in range(3, int(math.sqrt(number)) + 1, 2))
6
7
def main():
8
print(primeCheck(37))
0 commit comments