problem 4 : greatest palindrome from product

finds the greatest palindrome that is formed by the product of 2 n-digit
numbers.
n-digits =3 for the problem on eulerproject,