Computing very large Fibonacci numbers

Add a Review
1 Download (This Week)
Last Update:
Download fib-2-7-8.cpp.zip
Browse All Files
Windows BSD Mac Solaris Linux

Description

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.

Computing very large Fibonacci numbers Web Site

Update Notifications





Write a Review

User Reviews

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

Additional Project Details

Languages

English

Intended Audience

Developers, Science/Research

Programming Language

C++

Registered

2004-08-01
Screenshots can attract more users to your project.
Features can attract more users to your project.

Icons must be PNG, GIF, or JPEG and less than 1 MiB in size. They will be displayed as 48x48 images.