python.p0004 Namespace Reference

Functions
def	is_palindrome
def	main ()

Detailed Description

Project Euler Problem 4

I couldn't figure out how to do this as efficiently as I would have liked. I am
SURE that there is a better way to check if a number is a palindrome, but I
could not think of one.

Revision 1:

I changed is_palindrome to take in any repr function that you care to give it

Problem:

A palindromic number reads the same both ways. The largest palindrome made from
the product of two 2-digit numbers is 9009 = 91 × 99.

Find the largest palindrome made from the product of two 3-digit numbers.

Function Documentation

def python.p0004.is_palindrome

(

n

)

Here is the caller graph for this function:

def python.p0004.main

(

int

)

Here is the call graph for this function: