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.
Be the first to post a text review of Computing very large Fibonacci numbers. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Computing very large Fibonacci numbers using the primary recursive formula : Release 2.7-8 is availble at http://sourceforge.net/projects/fib-number/
Be the first person to add a text review.
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?
Thanks for your review!
Get credit for your review by logging in via OpenID. Click your account provider: