# Project Euler – Problem 4

This is the fourth post in my Project Euler series. The third problem is here. Problem 4 A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is [latex]9009 = 91 \cdot 99[/latex]. Find the largest palindrome made from the product of two 3-digit numbers. I was a little disappointed at…