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 numbers less than or equal to the input number.
Solution Stats
Problem Comments
6 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers1287
Suggested Problems
-
Increment a number, given its digits
688 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2890 Solvers
-
Convert a numerical matrix into a cell array of strings
2510 Solvers
-
991 Solvers
-
327 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Your last test case is accidentally all commented out, so isn't a real test case
The question is unclear. Do the factor-numbers all have to be two-digited?
@Jan-Andrea Bard, no.
Although it is not mentioned clearly in the problem statement but you can see a hint from the test suite
This problem would be really fun with larger test cases. It would eliminate kron() and stop naively checking every string combination.
@Brandon you could submit a new problem ("Palindromic Numbers - Hard Mode" or so).
Hello,
Just want to make a correction and make a clear problem statement. It is missing a multiplication sign.
"A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99."
Modified to be,
"A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99."