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
Veeam Data Platform v13.1 - Get Your Free Trial Icon
Veeam Data Platform v13.1 - Get Your Free Trial

Secure by design, portable by default. Recover clean, fast, anywhere. Start a free trial.

Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
Try it Free
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