Best calculator for recurrence relations

02252020, 04:14 PM
Post: #12




RE: Best calculator for recurrence relations
(02252020 03:08 PM)Csaba Tizedes Wrote: I don't know how it is works on HPs, but on TI83 you can do something like this: Should work, though it'll be fairly slow for large lists, since you'll have to run it about as many times as you have list elements. Here's a little 84 Plus CE program that prompts for all the inputs. This uses toString() to show the subscript when prompting for constants; this would have to be changed for an 83 (probably Disp X followed by an Input). Also, some of the prompt messages would need to be wrapped to fit the monochrome LCD models. Code: Input "NUMBER OF CONSTANTS? ",C The terms are calculated one at a time in increasing subscript order, and the list dimension increases by one with each term appended. Forward references will fail with a dimension error, i.e. you can only refer to prior (already calculated) list elements. You can rcl Y1 at the expression entry prompt if you want to run the program again with the same recursive formula, but different constants or max N. I tested it with the example  L1(1)=L1(2)=1, L1(N)=L1(L1(N2))+L1(NL1(N2))  and got the same first 20 terms. 

« Next Oldest  Next Newest »

User(s) browsing this thread: 1 Guest(s)