NL-NWO 2009 Problem 1
In this problem, we consider integers consisting of digits, of which the rst and last one are nonzero. We say that such an integer is a palindromic product if it satises the following two conditions:
- the integer is a palindrome, (i.e. it doesn't matter if you read it from left to right, or the other way around);
- the integer is a product of two positive integers, of which the first, when read from left to right, is equal to the second, when read from right to left, like and . For example, is a palindromic product, since , and itself is a palindrome. Determine all palindromic products of digits.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.