Problem 04

For this problem, we need to find the largest palindrome that can be formed by the product of two 3-digit numbers. Essentially, our upper product bound is 999 x 999 = 998001. To do this, we can make a function that takes in a 3-digit number and returns a 6-digit number. With this, we can loop through all 3-digit numbers starting at the upper bound and search for a 3-digit divisor. If this is found, then we have found the largest palindrome formed by the product of two 3-digit numbers.