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
Zenflow- The AI Workflow Engine for Software Devs Icon
Zenflow- The AI Workflow Engine for Software Devs

Parallel agents. Multi-agent orchestration. Specs that turn into shipped code. Zenflow automates planning, coding, testing, and verification.

Zenflow is the AI workflow engine built for real teams. Parallel agents plan, code, test, and verify in one workflow. With spec-driven development and deep context, Zenflow turns requirements into production-ready output so teams ship faster and stay in flow.
Try free now
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