Problem 235. Project Euler: Problem 4, Palindromic numbers
Solution Stats
Problem Comments
-
6 Comments
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."
Solution Comments
Show commentsProblem Recent Solvers1262
Suggested Problems
-
Remove any row in which a NaN appears
8762 Solvers
-
5008 Solvers
-
1218 Solvers
-
Split a string into chunks of specified length
2042 Solvers
-
The sum of the numbers in the vector
637 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!