I am taking a Finite Mathmatics class, and we are working with Matrices. The teacher handed out TI programs that let you pick the pivot for solving a system of equations using the Guass-Jordan method, but it only does it one step at a time. You pick the first pivot row and it returns the matrix with a 1 in the left most position of that row and zeros above and below. Then you pick the next row, and it returns the entire matrix with the first non-zero number as 1 in that row, with zeros above and below, and so on...

We are going to have applications later where the row we pick is important, so RREF will not work as he wants us to do one row at a time.

Has anyone seen a program like this? If I give you the TI program can anyone decipher so I can write one for the 48G?

Thanks!

*Edited: 20 Jan 2005, 12:18 a.m. after one or more responses were posted*