You are here
قراءة كتاب The First 1001 Fibonacci Numbers
تنويه: تعرض هنا نبذة من اول ١٠ صفحات فقط من الكتاب الالكتروني، لقراءة الكتاب كاملا اضغط على الزر “اشتر الآن"
style="margin-right: 0%; margin-left: 0%">[2] Honor the etext refund and replacement provisions of this "Small Print!" statement.
[3] Pay a trademark license fee to the Project of 20% of the net profits you derive calculated using the method you already use to calculate your applicable taxes. If you don't derive profits, no royalty is due. Royalties are payable to "Project Gutenberg Association/Carnegie-Mellon University" within the 60 days following each date you prepare (or were legally required to prepare) your annual (or equivalent periodic) tax return.
WHAT IF YOU *WANT* TO SEND MONEY EVEN IF YOU DON'T HAVE TO? The Project gratefully accepts contributions in money, time, scanning machines, OCR software, public domain etexts, royalty free copyright licenses, and every other sort of contribution you can think of. Money should be paid to "Project Gutenberg Association / Carnegie-Mellon University".
We are planning on making some changes in our donation structure in 2000, so you might want to email me, hart@pobox.com beforehand.
*END THE SMALL PRINT! FOR PUBLIC DOMAIN ETEXTS*Ver.04.29.93*END*
Mathematical constants and numbers edited by Simon Plouffe Associate Professor LaCIM, University of Quebec at Montreal http://www.lacim.uqam.ca/pi : Plouffe's Inverter plouffe@math.uqam.ca
The first 1001 fibonacci numbers. Definition F(n) = F(n-1)+F(n-2), each term is the sum of the 2 previous terms.
Pages
- « first
- ‹ previous
- 1
- 2
- 3
- 4