I am currently stuck at the problem of finding the largest palindrome number formed by the multiplication of two 3 digit numbers. I am not able to think of any solution other than the brute force method.
I have been googling around a bit in between work to find some theory for this. One that I found says this:
If you have a number say abc, and if it satisfies the following inequality
a^2 + b^2 + c^2 < 10
then the product of the two numbers abc and cba will be a palindrome. For example,
221 x 122 = 26962
But this way we cannot find the largest palindromic product.
I need to look more.
Popularity: 3% [?]
Related posts:
- Project Euler : Finding Largest 9-Pandigital Number Formed As A Concatenated Product
- Project Euler : Finding The nth Digit Of The Fractional Part Of Irrational Number
- Project Euler : Largest Product Of Five Consequtive Digits
- Project Euler : Palindrome Made From Product Of Three Digit Numbers
- Project Euler : Finding The Largest Prime Factor Of A Given Number
