**Introduction**

This program computes left and right hand approximations for
. It also includes the average of the approximations.

If you have not used one of the programs posted on this website before,
you should read through
the information in the Intro to Programming
section first.

**The Program **

:Disp "A" | {Disp is in PRGM under I/O} |

:Input A | {Input is in PRGM under I/O} |

:Disp "B" | |

:Input B | |

:Disp "N" | |

:Input N | |

:(B-A)/NH | {The arrow is STO} |

:AX | |

:0L | {The 0 is a zero} |

:1J | {The 1 is a one} |

:Lbl 1 | {Lbl is in PRGM under CTL} |

:L+Y1*HL | {Y1 is in Y-VARS under FUNCTION} {The * is the times sign} |

:X+HX | |

:IS>(J,N) | {IS> is in PRGM under CTL} |

:Goto 1 | {Goto is in PRGM under CTL} |

:BX | |

:L+Y1*HR | |

:AX | |

:R-Y1*HR | |

:(L+R)/2T | |

:Disp "LEFT RIGHT AVG" | {Disp is in PRGM under I/O} { " is on the + button} |

:Disp L | |

:Disp R | |

:Disp T |

**Running the Program**

You will need to enter a function *f*(*x*) into
Y1 before running
the program. The program will ask for values of A, B, and N (number of
subdivisions).

To test the program try the following:

*f*(*x*) = x^{2}+ 3,
A=1, B=4, N=20.

Your answer will be

LEFT RIGHT AVG

28.88625

31.13625

30.01125