w3resource

Python Challenges: Find the largest palindrome made from the product of two 4-digit numbers

Python Challenges - 1: Exercise-36 with Solution

Write a Python program to find the largest palindrome made from the product of two 4-digit numbers.

According Wikipedia - A palindromic number or numeral palindrome is a number that remains the same when its digits are reversed. Like 16461, for example, it is "symmetrical". The term palindromic is derived from palindrome, which refers to a word (such as rotor or racecar) whose spelling is unchanged when its letters are reversed. The first 30 palindromic numbers (in decimal) are: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 33, 44, 55, 66, 77, 88, 99, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, …

The largest palindrome made from the product of two 3-digit numbers is 913 * 993 = 906609.
Note: 9999 * 9901 = 906609

Sample Solution:

Python Code:

n = 0
for a in range(9999, 100, -1):
    for b in range(a, 100, -1):
        x = a * b
        if x > n:
            s = str(a * b)
            if s == s[::-1]:
                n = a * b
print(n)

Sample Output:

99000099

Flowchart:

Python Flowchart: Find the largest palindrome made from the product of two 4-digit numbers.

Python Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Python program to find the largest prime factor of a given number.
Next: Write a Python program to find the smallest positive number that is evenly divisible by all of the numbers from 1 to 30.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Become a Patron!

Follow us on Facebook and Twitter for latest update.

It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.

https://www.w3resource.com/python-exercises/challenges/1/python-challenges-1-exercise-36.php