User's Manual
Table Of Contents
- Quick-Start
- Precautions when Using this Product
- Contents
- Getting Acquainted— Read This First!
- Chapter 1 Basic Operation
- Chapter 2 Manual Calculations
- Chapter 3 List Function
- Chapter 4 Equation Calculations
- Chapter 5 Graphing
- 5-1 Sample Graphs
- 5-2 Controlling What Appears on a Graph Screen
- 5-3 Drawing a Graph
- 5-4 Storing a Graph in Picture Memory
- 5-5 Drawing Two Graphs on the Same Screen
- 5-6 Manual Graphing
- 5-7 Using Tables
- 5-8 Dynamic Graphing
- 5-9 Graphing a Recursion Formula
- 5-10 Changing the Appearance of a Graph
- 5-11 Function Analysis
- Chapter 6 Statistical Graphs and Calculations
- Chapter 7 Financial Calculation (TVM)
- Chapter 8 Programming
- Chapter 9 Spreadsheet
- Chapter 10 eActivity
- Chapter 11 System Settings Menu
- Chapter 12 Data Communications
- Appendix
20070201
Example To draw the WEB graph for the recursion formula
a n +1 = –3( a n )
2
+ 3 a n ,
b n +1 = 3 b n + 0.2, and check for divergence or convergence. Use the
following table range and V-Window settings.
Table Range
Start = 0, End = 6,
a 0 = 0.01, a n Str = 0.01, b 0 = 0.11, b n Str = 0.11
V-Window Settings
Xmin = 0, Xmax = 1, Xscale = 1
Ymin = 0, Ymax = 1, Yscale = 1
Procedure
1 m RECUR
2 !3 (V-WIN) a w b w b w c
a w b w b wJ
3 3 (TYPE)2 (
a n +1 )- d 2 ( a n )x +d 2 ( a n )w
d 3 (
b n )+a.c w
4 5 (SET)1 (
a 0 )
a w g w a.ab w a.bb w c
a.ab w a.bb wJ
5 6 (TABL)
6 4 (WEB)
7 w ~w (
a n is convergence)
c w ~w (
b n is divergence)
Result Screen
5-9-8
Graphing a Recursion Formula