blob: c581a726057ef6d961c17cc7e9cca636d4851af9 (
plain)
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
37
38
39
40
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"
|
