Problem 235. Project Euler: Problem 4, Palindromic numbers

Created by Doug Hull

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Find the largest palindrome made from the product of numbers less than or equal to the input number.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Thank you to</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://projecteuler.net/problem=4\"><w:r><w:t>Project Euler Problem 4</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

784 Solutions
242 Solvers

Last Solution submitted on Sep 18, 2020

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Alan Chalker on 16 Feb 2012

Your last test case is accidentally all commented out, so isn't a real test case

Solution Comments

Solution 34918

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.

Solution 26458

1 Comment

1 Comment

Aurelien Queffurust on 22 Jun 2012

Size 42 ! wow should be the best solution

Problem Recent Solvers242

Problem Tags

projecteuler

Problem 235. Project Euler: Problem 4, Palindromic numbers

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers242

Suggested Problems

More from this Author52

Problem Tags

Problem 235. Project Euler: Problem 4, Palindromic numbers

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers242

Suggested Problems

More from this Author52

Problem Tags

Players