Euler #4

https://projecteuler.net/problem=4

Python:

   1 #!/usr/bin/env python3
   2 
   3 def isPalindromic(arg):
   4     arg = str(arg)
   5     cut = int(len(arg)/2)
   6     (first, last) = (arg[:cut], arg[cut:][::-1])
   7     if (len(last) == len(first) + 1):
   8         last = last[:-1]
   9     return first == last
  10     
  11 biggest = 0    
  12 for x in range(100, 1000):
  13     for y in range(100, 1000):
  14         num = x * y
  15         if isPalindromic(num) and num > biggest:
  16             biggest = num
  17             
  18 print (biggest)