-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem3.py
More file actions
32 lines (28 loc) · 725 Bytes
/
problem3.py
File metadata and controls
32 lines (28 loc) · 725 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
# 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 ?
def prime_num(num):
i = 2
while i < num:
if (num % 2 == 0):
return (0)
i += 1
return (1)
# num = 13195 # largest prime -> 29
# num = 27465 # largest prime -> 1831
# num = 228 # largest prime -> 19
# num = 87216 # largest prime -> 79
num = 600851475143 # largest prime -> 6857
div = 2
list = []
while num > 2:
# print("num = ", int(num))
# print("prime :", div)
while (num % div != 0):
div = div + 1
while (prime_num(div) == 0):
div = div + 1
print("next prime :", div)
list.append(div)
num = int(num / div)
print("largest prime factor :", list[-1])