Swizec Teller - a geek with a hatswizec.com

Senior Mindset Book

Get promoted, earn a bigger salary, work for top companies

Senior Engineer Mindset cover
Learn more

    Lychrel numbers

    Last night I discovered another cool mathematical concept akin to the Collatz conjecture - Lychrel numbers.

    Collatz map fractal in a neighbourhood of the ...

    The idea of a lychrel number is pretty straightforward: Take a number, add its reverse, continue until you reach a palindrome number. If you never reach a palindrome, then this is a Lychrel number.

    Something like this:

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

    If you've ever done any theoretical computer science, you'll immediately spot a problem. This isn't a very good algorithm. Problem is with that "never" word in the description - an algorithm is a finite set of steps, when you need an infinite amount of steps to reach a conclusion that's ... not very useful.

    Honestly I am not certain what class of problems lychrel numbers fall into. The "not a lychrel number" is a half-decidable problem. It will always tell you when a number is not lychrel but it will never terminate when it is. If my understanding is correct, this would make "is a lychrel number" an non-decidable problem.

    Project Euler is kind enough to limit the problem a little bit and make it a fun algorithm to write before bed when your brain is half dead. Find all lychrel candidates under 10,000 assuming it should never take more than 50 iterations.

    Solving that problem becomes rather trivial in Haskell:

    reverse' = read . reverse . show
    palindrome n = n == reverse' n
    -- max denotes max recursion depth
    lychrel n max
      | max <= 0 = True
      | palindrome$n+r = False
      | otherwise = lychrel (n+r) (max-1)
        where r = reverse' n
    lychrels max =
      length [x | x <- [1..max], lychrel x 50]

    Oh and actually the first number that needs more than 50 iterations to converge into a palindrome is 10677, so the problem is pretty safely stated.

    For a final bit of fun, the number 4994, itself a palindrome, is a lychrel candidate.

    Published on January 27th, 2012 in Algorithm, collatzconjecture, Haskell, Math, Number Theory, Palindrome, Project Euler, Uncategorized

    Did you enjoy this article?

    Continue reading about Lychrel numbers

    Semantically similar articles hand-picked by GPT-4

    Senior Mindset Book

    Get promoted, earn a bigger salary, work for top companies

    Learn more

    Have a burning question that you think I can answer? Hit me up on twitter and I'll do my best.

    Who am I and who do I help? I'm Swizec Teller and I turn coders into engineers with "Raw and honest from the heart!" writing. No bullshit. Real insights into the career and skills of a modern software engineer.

    Want to become a true senior engineer? Take ownership, have autonomy, and be a force multiplier on your team. The Senior Engineer Mindset ebook can help 👉 swizec.com/senior-mindset. These are the shifts in mindset that unlocked my career.

    Curious about Serverless and the modern backend? Check out Serverless Handbook, for frontend engineers 👉 ServerlessHandbook.dev

    Want to Stop copy pasting D3 examples and create data visualizations of your own? Learn how to build scalable dataviz React components your whole team can understand with React for Data Visualization

    Want to get my best emails on JavaScript, React, Serverless, Fullstack Web, or Indie Hacking? Check out swizec.com/collections

    Did someone amazing share this letter with you? Wonderful! You can sign up for my weekly letters for software engineers on their path to greatness, here: swizec.com/blog

    Want to brush up on your modern JavaScript syntax? Check out my interactive cheatsheet: es6cheatsheet.com

    By the way, just in case no one has told you it yet today: I love and appreciate you for who you are ❤️

    Created by Swizec with ❤️