Basics Archives Community Services Programming
Hardware Help About Search Your Account
Home :: Archives :: File Archives :: Recursive Sequences
Recursive Sequences

FILE INFORMATION

Ranked as 31900 on our all-time top downloads list with 1610 downloads.
Ranked as 5473 on our top downloads list for the past seven days with 1 downloads.

recuring.zip
 Filename recuring.zip (Download) Title Recursive Sequences Description RECURING: This program calculates recursive sequences. It can deal with two previous terms: F(N-1), and F(N-2). You enter them as X and Y. For example the Fibonacci sequence: You enter 1 for F(1), and then X+Y for F(N), and for ’Find Term N?’, you enter the number in the sequence you wish to find, for example 25. Then the calculator displays F(2)-F(25), and shows: ’TERM:’,25,’IS:’,75025. You can of course also find sequences of just X. For example 2X+1. REKURSIV: This program is the same as RECURING, except that it can deal with three previous terms: F(N-1), F(N-2), and F(N-3). RECURS: This program is list based and can deal with up to 999 previous terms. You input F(N) as for example: L1(1)+L1(2)+L1(3). You also get the sum of the terms. Author Anders Tiberg (anders.tiberg@telia.com) Category TI-84 Plus C Silver Edition/CE BASIC Math Programs File Size 12,501 bytes File Date and Time Wed Oct 14 05:08:32 2015 Documentation Included? Yes

SCREEN SHOTS

REVIEWS

There are no reviews for this file.

LEAVE FEEDBACK

Questions, comments, and problems regarding the file itself should be sent directly to the author(s) listed above.

Write a review for this file (requires a free account)

Report inappropriate or miscategorized file (requires an account; or you may email us directly)

If you have downloaded and tried this program, please rate it on the scale below
 Bad Good 1  2  3  4  5  6  7  8  9  10

ARCHIVE CONTENTS

Archive Contents
Name Size
RECURING.8xp   320
RECURING.rtf   1623
RECURING1.png   5358
RECURING2.png   5059
RECURS.8xp   376
REKURSIV.8xp   360

Copyright © 1996-2019, the ticalc.org project. All rights reserved. | Contact Us | Disclaimer