title: Project Euler: Largest palindrome product of two 3-digit number
body: <p>I get <strong>580085</strong>, why is it wrong? And is there another way to check whether a number is a palindrome?</p>
  
  <pre><code>def reverse(str, aux=''):
      count = len(str)
      while count &gt; 0:
          aux += str[count-1]
          count -= 1
      return aux
  
  def palindrome(num):
      j = str(num)
      if j == reverse(j):
          return 1
      else:
          return 0
  
  i = 999
  found = 0
  while i &gt; 99 and not found:
      j = 999
      while j &gt; 99 and not found:
          if palindrome(i * j):
              found = 1
              print(i * j)
          else:
              j -= 1
      if not found:
          i -= 1
  </code></pre>
  
  <p>My post is mostly code, but I don't have anything else to say.</p>