Article View: bit.listserv.graph-ti
Article #250Graph-TI - Finonacci Program
From: Daniel G Millar
Date: Fri, 28 Oct 1994 00:03
Date: Fri, 28 Oct 1994 00:03
17 lines
1379 bytes
1379 bytes
Although I did not read the original post, I thought I may be able to assist Mr. Dunton with an easy program to find the nth Finonacci number. Pat Mara showed an intuitive recursive method- so I shall address a NONrecursive method. There is the program I quickly wrote on my TI-81. (1+5^(1/2))/2->A (1-5^(1/2))/2->B Disp "Fib Num?" Input N (1/5^(1/2))(A^N-B^N)->X Disp X The output is the Nth Fibonacci number. ...Dan dmillar@mail.sas.upenn.edu
Technical Details
Message-ID:
<9410280003.AA25244@mail1.sas.upenn.edu>Path:
arc1-ca.pugleaf.net!nntp.gmd.de!Germany.EU.net!EU.net!howland.reston.ans.net!swrinde!news.dell.com!paladin.american.edu!auvm!sas.upenn.edu!dmillarShow Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 104512,593fe677ec60fb68,start X-Google-Attributes: gid104512,public X-Google-ArrivalTime: 1994-10-27 17:03:43 PST Path: arc1-ca.pugleaf.net!nntp.gmd.de!Germany.EU.net!EU.net!howland.reston.ans.net!swrinde!news.dell.com!paladin.american.edu!auvm!sas.upenn.edu!dmillar Comments: Gated by NETNEWS@AUVM.AMERICAN.EDU Newsgroups: bit.listserv.graph-ti From: dmillar@sas.upenn.edu (Daniel G Millar) Posted-Date: Thu, 27 Oct 1994 20:03:43 -0400 (EDT) Message-ID: <9410280003.AA25244@mail1.sas.upenn.edu> Subject: Graph-TI - Finonacci Program Date: Thu, 27 Oct 1994 20:03:43 -0400 (EDT) X-Mailer: ELM [version 2.4 PL23-upenn2.8] Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Content-Length: 453 Sender: owner-graph-ti@dsmail.internic.net Precedence: bulk Reply-To: dmillar@sas.upenn.edu (Daniel G Millar) Lines: 17