Automatic commit performed through alias...

problems/005_problem.py

@@ -118,12 +118,6 @@ def main():
 #	the factor list, then compute their
 # 	collective product.
 
-	
-	pprint.pprint(factor_list)
-
-	for i in factor_list:
-		common.append(find_prime_factors(i))
-
 	pprint.pprint(common)
 
 	for j in common:
@@ -132,7 +126,7 @@ def main():
 
 	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"))