E-mail Webmaster


Recent Additions

Frank's Letters

English Section

Math Tutorials

TI Graphing Calculators
Mobile Phones & Pads

TI Program Descriptions

TI Programs
TI Programming Keystrokes

Python Programs

Brief User Guides

TI-82 User Manual
TI-83+ User Guide

TI-89 User Guide


TI-82 Statistics
TI-83 Plus Statistics
TI-84 Statistics
TI-89 Statistics

Other Topics
TI-83Plus Finite Math
TI-83 Plus Finance Math
TI-83 Plus Busines & Economics
TI-83 Plus Lin Prog
TI-83 Plus Geometry
TI-84 Conics APP
TI89 Calc Dif Eq
TI-89 Finance
Arithmetic of  Lists
TI-89t Busines & Economics


For Beginners
More Detailed Page 1
More Detailed Page 2
TI-89 FAQs

Links to  Guidebooks by TI
TI-83 Plus

Casio Graphing    Calculator

Casio Program Descriptions

Casio Programs
CFX-9850 & CFX-9750

Brief  Guides

CFX-9850 & CFX-9750
User Manual

Statistics Guide

Casio Programming Keystrokes
Brief Guides Other Calculators
HP 43S Calculator

Scientific Calculators
FAQs for Scientific Calculators


Sección Española

FAQs en Español
FAQs Basicos
Mas Dificil Pagina 1
Mas Dificil Pagina 2

Guías en Espaňol
TI-82 Espanol
TI-82 Estidisticas
TI-83 Plus Espanol
TI-83 Plus Estidisticas
TI-83 Plus Guía Financiera
TI-89 Titanium Guía
TI-89 Estidisticas
TI-89 Guía Financiera


Casio Calculadoras

Breve Guía Español
Cfx-9850 & Cfx-9750

Casio FAQs en Espanol

Calculadoras Científicos

FAQs en Espanol
Programs at Other Sites

Links to Tutorials


TI-82 Gauss & Gauss Jordan Elimination (rref & ref)

Application:  Notice that this program is not listed for the TI-83 Plus. It will work for the TI-83 series, but since rref and ref are built in on the TI-83, there is not much need for it.  I would mention that this offers a couple things that are not in the TI-83 Plus. For example, Upper Triangle display, and better treatment of non-orthodox matrices

Memory usage:  This program uses 972 bytes of memory.  I estimate that an inexperienced programmer can enter it in about 35 to 40 minutes.

Running the Program: First store your matrix in position [A]. After starting the program, the matrix is displayed for checking if desired, and the program is paused.  A menu is then presented that allows selection of either rref,  ref, or upper triangle.   As usual with matrices, I recommend that when you enter a new matrix, you enter each element, rather than just replacing those that are different.  The answer is displayed in fractions.  Engineering and science students and others who prefer decimals, just look at matrix [B].  The fractional answer is not stored in a matrix; only displayed on the home screen. 

Comments: This program operates similar to the ref and rref functions on the TI-83 Plus with some additions.  There should not be any divide-by-zero errors.  If you have any problems, please send an e-mail to me, the Webmaster.  I would also appreciate any suggestions you might have for improving the coding.   STCC students, please e-mail me at: fkizer@southwest.tn.edu

Revisions:  Version V1.1, date 12/13/04.  Version V1.2, 10/7/04.  There are some fairly significant changes from V1.1 to V1.2.  The working matrix has been changed from [A] to [B], and several lines have been added at the end to correct for the annoying characteristic the TI-82 has of displaying a number such as 1.2E-14 for 0.  Version 2.0, date 2/23/05 has the changes mentioned above.  There are no keystrokes listed for this program.  After 4/28/05, keystrokes will no longer be included in programs.

Program: TI82GsJr
:Disp "F KIZER"
:Disp "V 2.0 2235"
:Lbl 0
:dim [A]→L1
:Pause [B]
:If [B](K,K)≠1 and [B](J,K)=1 and P=0
:If [B](K,K)=0 and [B](J,K)≠0
:If M≠0 and N≠0
:Output(4,1,"3:UP TRIANG")
:Input "ENTER NO."  S
:If S=3 and C≤5
:If S=3
:Goto 7
:If C>R+1
:Goto 6
:If Q≠0 and Q≠1
:If S=2 and C≤R
:Goto 5
:If S=2:Goto 7
:If  C≤R
:Goto 4
:If [B](K,K)≠0 and [B](J,K)≠0
:If C=R+1
:Goto 7
:Lbl 4
:If C≤R
:If [B](K,K)≠0 and [B](J,K)≠0

Lbl 5
:If C≤R
:If  [B](K,K)≠0 and [B](J,K)≠0
:Lbl 6
:If C>R+1
:If Q≠0 and Q≠1
:If S=1 and C>R+1
:If [B](K,K)≠0 and [B](J,K)≠0
:Lbl 7
:If √(H2)<1E-7
:Pause [B]►Frac

New 4/18/05
Last Revised:  No Rev