-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQuestion3.py
36 lines (29 loc) · 857 Bytes
/
Question3.py
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
33
34
35
36
# The prime factors of 13195 are 5, 7, 13 and 29.
#
# What is the largest prime factor of the number 600851475143?
#QUESTION3
import timeit
start_time = timeit.default_timer()
elapsed = timeit.default_timer() - start_time
def max_prime_factor():
max_number = 600851475143
test_number = 13195
list_of_primes = []
for num in range(1,test_number):
prime = True
for i in range(2,num):
if (num%i==0):
prime = False
if prime:
list_of_primes.append(num)
for i in list_of_primes:
if test_number % i == 0:
print(i)
# for i in range(2, test_number+1):
# # print(i)
# if test_number % i == 0:
# list_of_primes.append(i)
# print(list_of_primes[-1])
print("Time taken:", elapsed, "seconds")
#run code
max_prime_factor()