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.
Categories
MathematicsLicense
GNU General Public License version 2.0 (GPLv2)Follow Computing very large Fibonacci numbers
Other Useful Business Software
Veeam Data Platform v13.1 - Get Your 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.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Computing very large Fibonacci numbers!