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
$300 Free Credits to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Start 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