Add solution 004

eberjoe · Jan 6, 2019 · 2704633 · 2704633
1 parent 551e48b
commit 2704633
Showing 1 changed file with 15 additions and 0 deletions.
diff --git a/problem004.py b/problem004.py
@@ -0,0 +1,15 @@
+# Largest palindromic product with factors of 'n' digits
+
+n = 3
+floor = 10**(n-1)
+ceiling = 10**n
+bigpal = 0
+
+for i in range(floor, ceiling):
+    for j in range(i, ceiling):
+        product = i*j
+        if str(product) == str(product)[::-1] and product > bigpal:
+            bigpal = product
+            f1 = i
+            f2 = j
+print(f1, "x", f2, "=", bigpal)