We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5d02103 commit 0c9b1b8Copy full SHA for 0c9b1b8
project_euler/problem_058/sol1.py
@@ -35,22 +35,22 @@
35
"""
36
37
38
-def isprime(d: int) -> int:
+def isprime(n: int) -> int:
39
40
- returns whether the given digit is prime or not
+ returns whether the given number is prime or not
41
>>> isprime(1)
42
0
43
>>> isprime(17)
44
1
45
>>> isprime(10000)
46
47
48
- if d == 1:
+ if n == 1:
49
return 0
50
51
i = 2
52
- while i * i <= d:
53
- if d % i == 0:
+ while i * i <= n:
+ if n % i == 0:
54
55
i = i + 1
56
return 1
0 commit comments