Problem 235. Project Euler: Problem 4, Palindromic numbers

Like (3)

Solve Later

Solution 34918

Submitted on 9 Feb 2012

Size: 20
Leading solution size is 7.

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Solve This Problem View on Solution Map

4 Comments

4 Comments

Show 1 older comment

Aurelien Queffurust on 22 Jun 2012

Cheating ...

Ned Gulley on 22 Jun 2012

Thanks for the note Aurelien. I added to the test suite.

zd c on 23 Apr 2020

the largest palindrome made from the product of 9999 is 99977999， not 99000099！
and x=999，y=997799, not 906609.
x=2500, y=6249246, not 6167616
x=100, y=999, not 9009

ChrisR on 9 May 2020

zd c, 99977999 cannot be written as the product of two numbers less than or equal to 9999.

Test Suite

Test	Status	Code Input and Output
1	Pass	%% x = 999; y_correct = 906609; assert(isequal(euler004(x),y_correct))
2	Pass	%% x = 9999; y_correct = 99000099; assert(isequal(euler004(x),y_correct))
3	Fail	%% x = 100; y_correct = 9009; assert(isequal(euler004(x),y_correct)) Error: Assertion failed.
4	Fail	%% x = 2500; y_correct = 6167616; assert(isequal(euler004(x),y_correct)) Error: Assertion failed.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 235. Project Euler: Problem 4, Palindromic numbers

Test Suite

Suggested Problems

More from this Author52

Community Treasure Hunt

Problem 235. Project Euler: Problem 4, Palindromic numbers

Test Suite

Suggested Problems

More from this Author52

Community Treasure Hunt

Players