20050501
Determining the General Term of a Recursion Expression
The following procedure converts the sequence expressed by a recursion expression to the
general term format
a
n
=
f
(
n
).
Example:
To determine the general term of the recursion expression
a
n
+
1
=
a
n
+ 2,
a
1
= 1
u
ClassPad Operation
(1) Start up the Sequence Editor.
• If you have another application running, tap
m
and then
H
.
• If you have the Sequence application running, tap
O
and then [Sequence Editor].
(2) Tap (or press)
O
, [Sequence RUN], [Calc], [rSolve], [
n
,
a
n
], [
a
n
+
1
],
=
, [
n
,
a
n
], [
a
n
],
+
,
2
,
,
, [
a
0
,
a
1
], [
a
1
],
=
,
1
, and then
)
.
(3) Press
E
.
6-3-5
Recursive and Explicit Form of a Sequence
Tip
• For information about the syntax of the “rSolve” function, see “2-7 Using the Action Menu”.
Summary of Contents for ClassPad 300 PLUS
Page 11: ...20050501 ClassPad 300 PLUS ClassPad OS Version 2 20 ...
Page 197: ...20050501 2 10 7 Using Verify 4 Input x 2 1 and press E 5 Input x i x i and press E ...
Page 649: ...20050501 u Graph Line Clustered D u Graph Line Stacked F 13 8 2 Graphing ...
Page 650: ...20050501 u Graph Line 100 Stacked G u Graph Column Clustered H 13 8 3 Graphing ...
Page 651: ...20050501 u Graph Column Stacked J u Graph Column 100 Stacked K 13 8 4 Graphing ...
Page 652: ...20050501 u Graph Bar Clustered L u Graph Bar Stacked 13 8 5 Graphing ...