Problem 235. Project Euler: Problem 4, Palindromic numbers
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
-
5 Comments
Show
2 older comments
Alan Chalker
on 16 Feb 2012
Your last test case is accidentally all commented out, so isn't a real test case
Jan-Andrea Bard
on 1 Nov 2021
The question is unclear. Do the factor-numbers all have to be two-digited?
Dyuman Joshi
on 2 Nov 2021
@Jan-Andrea Bard, no.
Although it is not mentioned clearly in the problem statement but you can see a hint from the test suite
Brandon
on 22 May 2023
This problem would be really fun with larger test cases. It would eliminate kron() and stop naively checking every string combination.
Christian Schröder
on 24 Dec 2023
@Brandon you could submit a new problem ("Palindromic Numbers - Hard Mode" or so).
Solution Comments
Show commentsProblem Recent Solvers1030
Suggested Problems
-
Back to basics 22 - Rotate a matrix
899 Solvers
-
Flip the main diagonal of a matrix
795 Solvers
-
1191 Solvers
-
700 Solvers
-
1397 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!