mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
98e9d6bdb6
* Fix style of the first ten solutions for Project Euler - Unify the header docstring, and add reference URLs to wikipedia or similar - Fix docstrings to be properly multilined - Add newlines where appropriate - Add doctests where they were missing - Remove doctests that test for the correct solution - fix obvious spelling or grammar mistakes in comments and exception messages - Fix line endings to be UNIX. This makes two of the files seem to have changed completely - no functional changes in any of the solutions were done (except for the spelling fixes mentioned above) * Fix docstrings and main function as per Style Guide
65 lines
1.5 KiB
Python
65 lines
1.5 KiB
Python
"""
|
|
Project Euler Problem 3: https://projecteuler.net/problem=3
|
|
|
|
Largest prime factor
|
|
|
|
The prime factors of 13195 are 5, 7, 13 and 29.
|
|
|
|
What is the largest prime factor of the number 600851475143?
|
|
|
|
References:
|
|
- https://en.wikipedia.org/wiki/Prime_number#Unique_factorization
|
|
"""
|
|
|
|
|
|
def solution(n: int = 600851475143) -> int:
|
|
"""
|
|
Returns the largest prime factor of a given number n.
|
|
|
|
>>> solution(13195)
|
|
29
|
|
>>> solution(10)
|
|
5
|
|
>>> solution(17)
|
|
17
|
|
>>> solution(3.4)
|
|
3
|
|
>>> solution(0)
|
|
Traceback (most recent call last):
|
|
...
|
|
ValueError: Parameter n must be greater than or equal to one.
|
|
>>> solution(-17)
|
|
Traceback (most recent call last):
|
|
...
|
|
ValueError: Parameter n must be greater than or equal to one.
|
|
>>> solution([])
|
|
Traceback (most recent call last):
|
|
...
|
|
TypeError: Parameter n must be int or castable to int.
|
|
>>> solution("asd")
|
|
Traceback (most recent call last):
|
|
...
|
|
TypeError: Parameter n must be int or castable to int.
|
|
"""
|
|
|
|
try:
|
|
n = int(n)
|
|
except (TypeError, ValueError):
|
|
raise TypeError("Parameter n must be int or castable to int.")
|
|
if n <= 0:
|
|
raise ValueError("Parameter n must be greater than or equal to one.")
|
|
prime = 1
|
|
i = 2
|
|
while i * i <= n:
|
|
while n % i == 0:
|
|
prime = i
|
|
n //= i
|
|
i += 1
|
|
if n > 1:
|
|
prime = n
|
|
return int(prime)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(f"{solution() = }")
|