shaun/euler-project
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Automatic commit performed through alias...

Browse Source
This commit is contained in:
Shaun Setlock
2020-04-25 15:55:32 -04:00
parent 2cc4e2fbde
commit 6a5c67aba0
1 changed files with 1 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/005_problem.py
View File

@@ -118,12 +118,6 @@ def main():
# the factor list, then compute their # the factor list, then compute their
# collective product. # collective product.
pprint.pprint(factor_list)
for i in factor_list:
common.append(find_prime_factors(i))
pprint.pprint(common) pprint.pprint(common)
for j in common: for j in common:
@@ -132,7 +126,7 @@ def main():
print(product) print(product)
print(set(factor_list))
# print("The largest palindrome number which is a product of two numbers of length {} is {} ... ".format("foo_list","foo")) # print("The largest palindrome number which is a product of two numbers of length {} is {} ... ".format("foo_list","foo"))