Web Graph (Convergence, Divergence) - Casio FX-CG20 AU User Manual
Hide thumbs
Also See for FX-CG20 AU:
- User manual (52 pages) ,
- Software user's manual (601 pages) ,
- Hardware user's manual (18 pages)
Table of Contents
Advertisement
• When "On" is selected "ΣDisplay" on the Setup screen and all three of the expressions
you input in the Recursion mode are selected for table creation, use the function menu
that appears when you press 3(PHASE) on the table screen to specify which two of the
expressions you want to use, and to specify whether you want to use numeric sequence
data or numeric sequence sum data.
1(
a
b
) .......... Graph using number sequences
•
2(
b
c
) .......... Graph using number sequences
•
3(
a
c
) .......... Graph using number sequences
•
4( Σ
a
b
) ....... Graph using the sums of number
•
5( Σ
b
c
) ....... Graph using the sums of number
•
6( Σ
a
c
) ....... Graph using the sums of number
•
k WEB Graph (Convergence, Divergence)
y
f
x
=
(
) is graphed by presuming
a
composed of
n
+1
divergent.
1. From the Main Menu, enter the Recursion mode.
2. Configure V-Window settings.
3. Select 2-term recursion as the recursion formula type, and input the formula.
4. Specify the table range,
5. Display the recursion formula number table.
6. Draw the graph.
7. Press w, and the pointer appears at the start point you specified.
Press w several times.
If convergence exists, lines that resemble a spider web are drawn on the display. Failure
of the web lines to appear indicates either divergence or that the graph is outside the
boundaries of the display screen. When this happens, change to larger V-Window values
and try again.
You can use fc to select the graph.
a
a
b
b
(
,
) and
(
n
+1
n
+2
n
n
+1
b
b
c
c
(
,
) and
(
+1
+2
+1
n
n
n
n
a
a
c
c
(
,
) and
(
n
+1
n
+2
n
n
+1
a
a
a
sequences
(
,
n
n
+1
n
b
b
b
sequences
(
,
n
n
+1
n
a
a
a
sequences
(
,
n
n
+1
n
a
=
n
+1
a
,
. Next, it can be determined whether the function is convergent or
n
n
start and end points, initial term value, and pointer start point.
a
n
b
,
)
n
+2
b
n
c
,
)
+2
n
a
n
c
,
)
n
+2
b
b
b
) and
(
,
)
+2
n
n
+1
n
+2
c
c
c
) and
(
,
)
+2
n
n
+1
n
+2
c
c
c
) and
(
,
)
+2
n
n
+1
n
+2
y
a
x
,
=
for linear two-term recursion
n
5-47
a
f
a
=
(
)
n
+1
n
Advertisement
Table of Contents
