Problem 1082. Lychrel Number Test (Inspired by Project Euler Problem 55)

Created by @bmtran (Bryant Tran)

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>The task for this problem is to create a function that takes a number</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>n</w:t></w:r><w:r><w:t> and tests if it might be a Lychrel number. This is, return</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:rFonts w:cs=\"monospace\"/></w:rPr><w:t>true</w:t></w:r><w:r><w:t> if the number satisfies the criteria stated below.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>From Project Euler:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://projecteuler.net/problem=55\"><w:r><w:t>Link</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Not all numbers produce palindromes so quickly. For example,</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>349 + 943 = 1292, 1292 + 2921 = 4213 4213 + 3124 = 7337</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>That is, 349 took three iterations to arrive at a palindrome.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Although no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Surprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.</w:t></w:r></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>"}]}

The task for this problem is to create a function that takes a number n and tests if it might be a Lychrel number. This is, return <tt>true</tt> if the number satisfies the criteria stated below.From Project Euler: <a href="http://projecteuler.net/problem=55">Link</a>If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.Not all numbers produce palindromes so quickly. For example,349 + 943 = 1292,
1292 + 2921 = 4213
4213 + 3124 = 7337That is, 349 took three iterations to arrive at a palindrome.Although no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).Surprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.

The task for this problem is to create a function that takes a number _n_ and tests if it might be a Lychrel number. This is, return |true| if the number satisfies the criteria stated below.

*From Project Euler:* <http://projecteuler.net/problem=55 Link>

If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.

Not all numbers produce palindromes so quickly. For example,

349 + 943 = 1292,
1292 + 2921 = 4213
4213 + 3124 = 7337

That is, 349 took three iterations to arrive at a palindrome.

Although no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).

Surprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.

Solve

Solution Stats

292 Solutions
81 Solvers

Last Solution submitted on Apr 03, 2023

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

bainhome on 6 Apr 2018

I think this assertion part is obsolete, in the form of "assert(islychrel(n))" or "assert(~islychrel(n))" now will fail directly on the new cody system. my code run at my computer seems fine by the way.

Tom Holz on 18 Aug 2018

It looks like there is an error in the test suite, because 3664 becomes 475574 after 5 iterations, although the test suite says that it's not a Lychrel number. (In addition, OEIS A023108, which lists all non-Lychrel numbers up to 3675, excludes 3664).

Rafael S.T. Vieira on 9 Aug 2020

Currently, the test suite seems to be working fine.

Nguyen Huy on 15 May 2021

Tom Holz cause you and me is misunderstood the problem,the problem is check number "not palindrome"

Solution Comments

Show comments

Problem Recent Solvers81

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 1082. Lychrel Number Test (Inspired by Project Euler Problem 55)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers81

Suggested Problems

More from this Author56

Problem Tags

Community Treasure Hunt

Problem 1082. Lychrel Number Test (Inspired by Project Euler Problem 55)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers81

Suggested Problems

More from this Author56

Problem Tags

Community Treasure Hunt

Players