PROGRAM DESCRIPTIONS FOR TI CALCULATORS

NOTE:  If you arrived here through a link on a program list, please be advised that all of those links lead to this page of descriptions and not to specific descriptions for  the program you clicked on.  Scroll down the list to find your program.  You may go back to the sheet with the list of programs by clicking here.

Fractions: (tifractions):  This is a menu-driven program that does addition, subtraction, multiplication, and division of fractions (or whole numbers, incidentally) and gives the results in mixed numbers.  Since doing that on a TI-82/83 requires several keystrokes, this program will save you some work if you have several fractions to work with.  To make this program as easy to load as possible and to take up as little memory as possible, I have required that the numbers  be input to lists.  I'll give examples of how this works below the coding sheet in the TI Programs listing.   This program uses 268 bytes of memory, and I estimate that an inexperienced programmer will need between 10 and 15 minutes to enter it.

Quadratics (tiquadratics):  This program will solve quadratics with real or imaginary roots.  Answers are given in factored radical form when appropriate, and imaginary roots are followed by "i."   Because of the formatting limitations for fractions with the TI-82/83, the -b/2a and the fraction, if any, before the radical are listed separately.  While I don't like this, I know of no way to work around it at this time.  The only inputs required for this program are a, b, and c when prompted.   This is the first version of this program, so it may be revised soon.

 Matrix Row Operations (MATRWOP2):   This program was written primarily for students who are required to learn how to do Gauss and Gauss-Jordan elimination on matrices by hand, but who want to avoid the arithmetic involved in hand solutions.  It is also useful for use in classrooms in conjunction with the companion program for the TI to provide the same interface for the TI-82/83 and the Casio CFX-9850/Plus. 
     Note that the TI program will convert answers in decimals to fractions by choosing item 7.  This can be done with a  matrix in [A] position even though it was not produced by this  program.  The conversion to fractions is, of course,  subject to the normal limitations of the conversion to fractions present with manual operation. 
     This program uses 417 bytes of memory.  I estimate that an inexperienced programmer can enter it in about 20 minutes.

Gauss & Gauss-Jordan Elimination:(RREFREF2) This program gives the TI-82 the same capability as the TI-83 to convert a matrix to ref (row-echelon form) or  rref (reduced row-echelon form).  The TI-83 has this capability, so there is no need to use this program for the TI-83 and TI-83 Plus.  The present version displays the matrix in fractions where appropriate, and keeps the decimals in the working matrix, [B].  The coding has been added to the latest version to correct the slightly annoying characteristic of the TI-82 to display a number like 1.2E-12 instead of zero.
     This program uses 547 bytes of memory.  I estimate that an inexperienced programmer can enter it in 25 to 30 minutes.

Solving Polynomials with Synthetic Division:(TPLYSLV2)  This is a menu-driven, interactive program that solves the polynomial by successive synthetic division steps under the direction of the student.  The student enters the zero that he/she wants to use as a trial divisor.  A polynomial with real coefficients may be solved completely with synthetic division, but the option is available to switch to solution of a quadratic when the polynomial has been reduced to second degree.  The quadratic solution will give imaginary roots if appropriate. 
     This program uses 413 bytes of memory.  I estimate it will take an inexperienced programmer about 20  minutes to enter the coding.

Synthetic Division (One Step): (SYNDIV1) This program only does synthetic division once.  The student enters the trial zero; then the coefficients in list format, i.e., with braces.  The total result of the division is displayed, and the remainder is then displayed separately.  with the remainder.
    This program uses 169 bytes of memory.  An inexperienced programmer should be able to enter this in about 10 minutes.

Synthetic Division (One Step): (SYNDIV)  This program only does synthetic division once and leaves the answer in factored form rather than as a decimal.   The student enters the trial zero; then the coefficients in list format, i.e., with braces.  The total result of the division is displayed, and the remainder is then displayed separately.
I'M DOING A LITTLE TWEEKING ON THE FORMAT AT THIS TIME. 
    This program will probably use about 200 bytes of memory.  An inexperienced programmer should be able to enter this in less than 15 minutes.  (Note:  As of 10/2/04, I have had no inquiries about this program, so I have put a very low priority on completing it.)

Simplex Pivoting Method:  This program is complete, but I'm not satisfied with it just yet.  I expect to have to have it complete by the beginning of the fall semester of 04.  It probably will use a little over 300 bytes of memory. 

Simplex Program Using Positive Slack Variables (tisimplex_pos):   This program is for those who are familiar with the simplex method that uses POSITIVE slack variables when doing problems with mixed constraints or minimization.  You must enter the first tableau in matrix [A] with the proper slack variables and with the proper signs for the indicator row (objective function.)  The program then manipulates rows to give a first feasible solution and displays the solution in decimal form.  The solution may be displayed in fractional form, if appropriate, by pressing ENTER.  When you are finished with the answer, press ENTER because the program is STILL RUNNING in PAUSE Mode to permit scrolling the matrix. I am not the author of the ideas in this program.

Simplex Program Extension using Negative Slack Variables (tisimplex_ext):   This is a menu driven front-end extension to the above program for positive slack variables, that permits use of negative slack variables with that program.  You must have the program tisimplex_pos entered in your calculator in order for this program to give you anything other than the initial tableau for minimizations or mixed constraints.   This program sets up the first feasible tableau for mixed inequalities and standard minimization problems.  The program tisimplex_pos and then solves that tableau  for the final optimized tableau.  Appropriate negative slack variables must entered for mixed, or minimization problems.  Of course, you can solve standard maximization problems by entering the first tableau with appropriate positive slack variables and choosing the appropriate item from the menu. 

Simplex Program Using Negative Slack Variables (tisimplex_neg):   This stand-alone program is for those who are familiar with the simplex method that uses negative slack variables when doing problems with mixed constraints or minimization.  You must enter the first tableau in matrix [A] with the proper slack variables and with the proper signs for the indicator row (objective function.)  The program then manipulates rows to give a first feasible solution and displays the solution in decimal form.  The solution may be displayed in fractional form, if appropriate, by pressing ENTER.  When you are finished with the answer, press ENTER because the program is STILL RUNNING in PAUSE Mode to permit scrolling the matrix.  

Inequality Graphing for TI-82 ( tiineqgraf ):  This program simplifies graphing inequalities for the TI-82.  The user enters the right side of the inequalities (up to three) in the Y= area as usual.  Then after starting the program, the user tells the calculator whether to shade above the line or below the line.  After each of the first two inequalities, the user is asked whether to quit or graph another inequality.

Loan Amortization Tables: (tiloanamrt):  This is a .8xP file and can only be read by GraphLink.  This program is for download only at this time.  At a later time, I may translate this into a Word file.  This program will store Monthly Payment, Interest, Principal Payment, and Loan Balance in lists L₁ through L₄ respectively.  The appropriate values must be entered into APPS, Finance, TMV Solver in order to use the calculations.  The inputs are the first and last payment numbers that you want stored in the lists.  Of course, you must go to the Lists in order to read the data.   The maximum number of characters, including minus signs and decimals, displayed in the tables is five.  You may read each individual value more accurately by moving the cursor to the value you want and reading the numbers at the bottom of the list table.  

Last Revised: 5/9/06