A tool written in C++ to generate very large Fibonacci numbers using the primary recursive formula: F(n) = F(n-1) + F(n-2) n > 1; F(1) = 1, F(0) = 0.

Project Activity

See All Activity >

Categories

Mathematics

License

GNU General Public License version 2.0 (GPLv2)

Follow Computing very large Fibonacci numbers

Computing very large Fibonacci numbers Web Site

Other Useful Business Software
Earn up to 16% annual interest with Nexo. Icon
Earn up to 16% annual interest with Nexo.

More flexibility. More control.

Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
Get started with Nexo.
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Computing very large Fibonacci numbers!

Additional Project Details

Operating Systems

BSD, FreeBSD, Linux, NetBSD, OpenBSD, Solaris, Windows

Languages

English

Intended Audience

Developers, Science/Research

Programming Language

C++

Related Categories

C++ Mathematics Software

Registered

2004-08-01