nowfound

Life & fun · February 29, 2020

Twelve Simple Algorithms to Compute Fibonacci Numbers

Abstract page for arXiv paper 1803.07199: Twelve Simple Algorithms to Compute Fibonacci Numbers

Twelve Simple Algorithms to Compute Fibonacci Numbers launched on February 29, 2020 with 13 votes, #743 of 3,162 launches that month and more than 75% of that year's launches. The site was still online in September 2026, 6 years on.

Visit arxiv.org ↗Alternativestop 23% of February 2020

In plain words

This is a technical paper that explores twelve different algorithmic approaches to computing Fibonacci numbers. Published in 2020, it examines various methods for calculating this mathematical sequence, ranging from basic to advanced techniques. The work is intended for mathematicians, computer science students, and anyone interested in algorithm design and computational efficiency. It provides a comparative analysis of different computational strategies without focusing on a single optimal solution.

written from the facts on this page · September 2026

From the sources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabsfrom arxiv.org

Does a similar job

all alternatives →
  • Fibonacci2020 · apps.apple.com · ▲76

    A clever maths pattern turned into a fun puzzle game

  • IM
    I made a calculator that works over disjoint sets of intervalsApr 2026 · victorpoughon.github.io · ▲314

    I've been studying interval arithmetic for the past few weeks and it's a really interesting field because while there is a ton of super interesting research published over the past decades, it has never really gotten the recognition that it deserves, IMO. One reason for this is that standard interval arithmetic has really poor handling of division by intervals containing zero. If you compute 1 / [-1, 2] in regular interval arithmetic, you get either [-∞, +∞], or you have to say that the operation is undefined. Both solutions are virtually useless. The real answer of course is [-∞, -1] U…

  • An Elementary Introduction to the Wolfram Language2015 · wolfram.com · ▲60

    Stephen Wolfram's new book on the Wolfram Language

  • Allocate poker chips optimally with mixed-integer nonlinear programming2024 · github.com · ▲213

    Every time I play a casual cash poker game with friends, we spend the first several minutes struggling to figure out chip denominations. I built this to automate that process. Try it out here (the submitted link goes to the GitHub repo): https://jstrieb.github.io/poker-chipper/ It turns out that picking chip denominations optimally—such that as many chips are distributed as possible, and such that the denominations are nice—is hard (in the computational complexity sense). Upon reflection, the problem seemed to be a perfect fit for constrained optimization. I first got a…

  • Introduction to Algorithms2015 · amazon.com · ▲92

    Broad span of algorithms, covered in clear depth

  • Math Puzzle | Fibonacci Game2024 · play.google.com · ▲13

    My small puzzle game

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, February 2020

the whole month →