
November 19th, 2012, 01:11 PM
|
 |
Contributing User
|
|
Join Date: Dec 2011
Posts: 35

Time spent in forums: 14 h 14 m 21 sec
Reputation Power: 2
|
|
|
An expression that stores to a variable while simultaneously adopting that variable as a component of the expression.
Using T for practice, if you initialize with zero then iterate 3√(T)+1→T, you'll get 1, 4, 7, …, eventually converging on 29√6. To let a program do this for you six times and display only the last value, you can write:
:0→T
:For(K,1,6)
:3√(T)+1→T
:End
:Disp T
Another option—probably more of what you're looking for—is playing with sequence variables, which are primarily reserved for recurrence equations. Select SEQ from the [MODE] screen then press [Y=]. Set nMin=0, u(n)=3√(u(n-1))+1, and u(nMin)={0}. Here, u(n-1) is better understood as the previous term in the sequence, or by interpreting what's inside the parentheses as subscripts.
You can then return to the home screen and type u(6) for the sixth value in that sequence, which should match the program's response.
If you need more help, keep asking.
|