KEY IN | DISPLAY | EXPLANATION |
PRGM -> -> ENTER SIMPSON | Prgm 1: SIMPSON | Program named "SIMPSON" |
2nd VARS 5 2 | FnOff | Deselects all functions |
Disp 2nd ![]() | Disp "LOWERLIMIT" | Lower limit of integration |
Input ![]() | Input A | After ?, type in the lower limit of integration |
Disp 2nd ![]() | Disp "UPPERLIMIT" | Upper limit of integration |
Input ![]() | Input B | After ?, type in the upper limit of integration |
Disp 2nd ![]() ![]() | Disp "N SUBINTERVALS" | Number of subintervals for [A, B] is N |
Disp 2nd ![]() | Disp "ENTER EVEN N" | The even integer N is to be entered |
Input ![]() | Input N | After ?, type in N |
0 STO ![]() | ![]() | 0 is stored in location S (for Simpson's Rule) |
0 STO ![]() | ![]() | 0 is stored in location V (for the Trapezoidal Rule) |
(![]() ![]() ![]() ![]() ![]() | (B - A)/N -> W | Subinterval width (B-A)/N stored in location W |
1 STO ![]() | 1 -> J | 1 is stored in location J |
Lbl 1 | Lbl 1 | Start of loop |
![]() ![]() ![]() ![]() | A + 2(J - 1)W -> L | Left endpoint of [A+2(j-1)W, A+2jW] stored in L |
![]() ![]() ![]() ![]() | A + 2JW -> R | Right endpoint of [A+2(j-1)W, A+2jW] stored in R |
(![]() ![]() ![]() ![]() | (L + R)/2 -> M | Midpoint of [A+2(j-1)W, A+2jW] stored in M |
![]() ![]() | L -> X | L is stored in location X |
2nd VARS 1 1 STO ![]() | Y1 -> L | Y1(L) is stored in location L |
![]() ![]() | M -> X | M is stored in location X |
2nd VARS 1 1 STO ![]() | Y1 -> M | Y1(M) is stored in location M |
![]() ![]() | R -> X | R is stored in location X |
2nd VARS 1 1 STO ![]() | Y1 -> R | Y1(R) is stored in location R |
![]() ![]() ![]() ![]() ![]() ![]() ![]() | W(L+4M+R)/3 + S -> S | New sum is stored in location S (for Simp. Rule) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() | W(L+2M+R)/2 +V -> V | New sum is stored in location V (for Trap. Rule) |
IS > ![]() ![]() | IS > (J,N/2) | Increment J one step. If J>N/2, skip next command |
Goto 1 | Goto 1 | Program returns to Lbl 1 and loops again |
Disp 2nd ![]() | Disp. "Simpson Rule" | Prepares for the Simpson's Rule approximation |
Disp ![]() | Disp S | Displays the Simpson's Rule approximation S |
Disp 2nd ![]() | Disp. "Trap. Rule" | Prepares for the Trapezoidal Rule approximation |
Disp ![]() | Disp V | Displays the Trapezoidal Rule approximation V |
2nd QUIT (to quit the program)
Y= key in your function f(x) ENTER
2nd QUIT
PRGM (choose the program) ENTER
The display reads | LOWERLIMIT, ? | Key in A ENTER | (gives the lower limit of integration) |
The display reads | UPPERLIMIT, ? | Key in B ENTER | (gives the upper limit of integration) |
The display reads | ... ENTER N, ? | Key in N ENTER | (gives number of interval into which [A, B] is divided) |
To execute the program again, just key in ENTER
Identification of italicized words in the program:
Input | (PRGM -> 1) |
Display | (PRGM -> 3) |
Label | (PRGM -> 9) |
Goto | (PRGM ![]() |
Is > | (PRGM aA) |
represents zero (distinguished from the letter 0)
If you type then you get a "space" (between two words)