We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 736d371 commit 992bd3dCopy full SHA for 992bd3d
project_euler/problem_03/sol2.py
@@ -7,7 +7,7 @@
7
"""
8
9
10
-def solution(n):
+def solution(n: int = 600851475143) -> int:
11
"""Returns the largest prime factor of a given number n.
12
13
>>> solution(13195)
@@ -41,15 +41,19 @@ def solution(n):
41
raise TypeError("Parameter n must be int or passive of cast to int.")
42
if n <= 0:
43
raise ValueError("Parameter n must be greater or equal to one.")
44
+
45
prime = 1
46
i = 2
47
48
while i * i <= n:
49
while n % i == 0:
50
prime = i
51
n //= i
52
i += 1
53
54
if n > 1:
55
prime = n
56
57
return int(prime)
58
59
0 commit comments