Computing very large Fibonacci numbers Icon

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

KEEP ME UPDATED

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

Thanks for helping keep SourceForge clean.

Screenshot instructions:
Windows
Mac
Red Hat Linux   Ubuntu

Click URL instructions:
Right-click on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)

More information about our ad policies
X

Briefly describe the problem (required):

Upload screenshot of ad (required):
Select a file, or drag & drop file here.

Please provide the ad click URL, if possible:

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

No, thanks
Screenshots can attract more users to your project.
Features can attract more users to your project.