19990401
Example
Generate a number table from recursion between three terms as
expressed by
a
n
+
2
=
a
n
+
1
+
a
n
, with initial terms of
a
1
= 1,
a
2
= 1
(Fibonacci sequence), as
n
changes in value from 1 to 6.
Procedure
1
m
RECUR
2
3
(TYPE)
d
(
a
n
+
2
=)
3
4
(
n
.
a
n
··
)
d
(
a
n
+
1
)
+
2
(
a
n
)
w
4
5
(RANG)
2
(
a
1
)
b
w
g
w
b
w
b
w
i
5
6
(TABL)
Result Screen
5-9-2
Graphing a Recursion Formula
# Specifying On for the
(
Display of the SET UP
screen causes the sum of each term to be
included in the table.
Summary of Contents for ALGEBRA FX 2.0
Page 1: ... ALGEBRA FX 2 0 User s Guide ...
Page 19: ...19990401 ALGEBRA FX 2 0 ...
Page 26: ...19990401 1 1 Keys 1 1 1 Keys REPLAY COPY PASTE CAT CAL H COPY PRGM List Mat i ...
Page 122: ...19990401 ...
Page 280: ...19990401 ...
Page 310: ...19990401 ...
Page 358: ...19990401 8 8 2 Program Library egcw w ww w ...
Page 360: ...19990401 8 8 4 Program Library Example 1 Example 2 fw baw bf w fw baw ca w ...
Page 362: ...19990401 8 8 6 Program Library ...
Page 364: ...19990401 8 8 8 Program Library dw fcde wfcde wfcde fcde w daw w ...
Page 366: ...19990401 8 8 10 Program Library b awaw bwaw aw9d w ...
Page 423: ...19981001 MEMO ...
Page 424: ...19981001 MEMO ...
Page 425: ...19981001 MEMO ...