# Project Euler No.4

Project Eulerの第4問は「数字の回文」。

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.

maxnum = 0;
for n1 = 100:998
for n2 = n1+1:999
num = n1 * n2;
if num == str2double(fliplr(num2str(num)))
if maxnum < num
maxnum = num;
end
end
end
end
disp(maxnum);