20050401
○ ○ ○ ○ ○
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)
3
(
a
n
+
2
)
3
4
(
n
.
a
n
··
)
3
(
a
n
+
1
)
+
2
(
a
n
)
w
4
5
(SET)
2
(
a
1
)
b
w
g
w
b
w
b
wJ
5
6
(TABL)
Result Screen
5-9-2
Graphing a Recursion Formula
# Pressing
1
(FORM) will return to the screen
for storing recursion formulas.
* The first two values correspond to
a
1
= 1 and
a
2
= 1.
# Specifying On for the
Σ
Display of the Setup
screen causes the sum of each term to be
included in the table.
Summary of Contents for fx-9860G AU PLUS
Page 1: ...fx 9860G AU User s Guide E http edu casio com ...
Page 2: ...Important Please keep your manual and all information handy for future reference ...
Page 27: ...20050401 1 1 Keys 1 1 1 Keys ...
Page 335: ...20050401 u u u u u Input Example u u u u u Results 6 5 25 Tests ...
Page 361: ...20050401 Calculation Result Output Example p F distribution probability 6 7 15 Distribution ...
Page 435: ...20050401 8 8 2 Program Library egcw w ww w ...
Page 437: ...20050401 8 8 4 Program Library Example 1 Example 2 fw baw bf w fw baw ca w ...
Page 439: ...20050401 8 8 6 Program Library wba wb w w d ...
Page 441: ...20050401 8 8 8 Program Library dw fcde wfcde wfcde fcde w daw w 20070101 ...
Page 443: ...20050401 8 8 10 Program Library b awaw bwaw aw x d w ...
Page 590: ...CASIO COMPUTER CO LTD 6 2 Hon machi 1 chome Shibuya ku Tokyo 151 8543 Japan SA0701 E ...
