aboutsummaryrefslogtreecommitdiffstats
path: root/palindrome.py
diff options
context:
space:
mode:
authormjfernez <mjfernez@gmail.com>2018-12-02 19:12:42 -0500
committermjfernez <mjfernez@gmail.com>2018-12-02 19:12:42 -0500
commitd62ba829dc3a54edc46b7deb581dd244713393f5 (patch)
tree637d985d70fff70c4dedc14a45c559747ea18b84 /palindrome.py
parentc15221f10ed2ea4a55b474a57b6ee39f6b24ac85 (diff)
downloadProject_Euler_Solutions-d62ba829dc3a54edc46b7deb581dd244713393f5.tar.gz
add code
Diffstat (limited to 'palindrome.py')
-rw-r--r--palindrome.py41
1 files changed, 41 insertions, 0 deletions
diff --git a/palindrome.py b/palindrome.py
new file mode 100644
index 0000000..c581a72
--- /dev/null
+++ b/palindrome.py
@@ -0,0 +1,41 @@
+import PIL, math
+import numpy as np
+
+#Problem 4 - Palindrome Products
+
+def isPalindrome(number):
+ numchar = str(number)
+ middle = len(numchar)/2
+ face = numchar[:middle]
+ ref = numchar[len(numchar):middle-1:-1]
+ if(face == ref):
+ return True
+ else:
+ return False
+
+def findProduct(number):
+ for i in range(999,100,-1):
+ for j in range(999,100,-1):
+ if(i*j==number):
+ return [i,j]
+
+def findMaxPalindrome():
+ large = 0
+ for i in range(999,100,-1):
+ for j in range(999,100,-1):
+ test = i*j
+ if(isPalindrome(test) and test > large):
+ large = test
+ return large
+
+answer = findMaxPalindrome()
+print answer
+print "The factors are: " + str(findProduct(answer))
+#x = input("Type a palindromic number: ")
+
+#if(isPalindrome(x)):
+ #print "The factors are: " + str(findProduct(x))
+#else:
+ #print "not a palindrome"
+
+