Email Webmaster
_______________ Navigation
Home ________________ TI Graphing Calculators TI Programs Brief User Guides Casio Graphing Calculator Casio Programs Casio Programming
Keystrokes Scientific Calculators =============== Casio Calculadoras
Breve Guía Español Calculadoras Científicos

PROGRAM DESCRIPTIONS FOR CASIO CALCULATORS Matrix Row Operations:(MATRWOP2) This program
was written primarily for students who are required to learn how to do Gauss and
GaussJordan elimination of matrices by hand, but who want to avoid the
arithmetic involved in hand solutions. It is also useful for use in
classrooms that primarily use the TI83Plus for doing matrices. This
program provides a user interface for Gauss/GaussJordan, fairly similar to the
TI83Plus. Gauss & GaussJordan Elimination:(RREFREF2)
This program was written to remove confusion when some students in a group
have Casio calculators and others have TI calculators.
This program gives the Casio CFX9850 Plus the capability to convert a matrix to
ref (rowechelon form) or rref (reduced rowechelon form) using a
format similar to the TI83/83Plus. This program, REFRREF2, must have the
Casio program ROWREDA activated in order to do rref. The method of
activating the Casio program is explained in the file for the program
REFRREF2. The student does not participate in this program other than to
enter the matrix in position A and select either rref or ref. Solving Polynomials with Synthetic
Division:(CPLYSLV1) This is a pseudo menudriven program that
has the student enter the zero that they desire to try. 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. 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
result of the division is displayed with the remainder. A separate
remainder may be displayed by pressing EXE after the solution is displayed. Simplex Method for Linear Programming (Best): This is a Casio archived program that can be loaded into active memory and used like any other program except that it cannot be edited and the code cannot be read without the password. This program uses the Simplex method of solving linear programming problems. The first tableau must be formulated and entered into Matrix A. It handles standard maximization problems (those with ≤) okay, but some "reformulation" of the matrix must be done before using this program for a minimization program. On the program sheet, I've showed an example of how to convert a standard minimization problem before entry, so that the converted tableau can then be solved by this program. Mixed constraint problems can be handled by adding positive surplus variables and making the inequality negative for the ≥ constraints; then doing row operations to eliminate the resulting negative variables. More detail on that is beyond the scope of this short instruction. This program takes about 30 seconds to activate. Simplex Method (Second Best): This program does problems in standard maximizations, standard minimizations, and mixed inequalities. It is only for those who don't understand how to do the minimization and mixed constraint problems on the program LINPROG mentioned directly above. Frankly, I suggest that you spend a few minutes understanding how to use that program. If you use negative slack variables for ≥ in your coursework, you may want to use this program. This is a frontend addon to the program LINPROG that is archived in the Casio CFX9850Plus calculator. You must activate LINPROG in order to use this program. You can find out how to do that on the program sheet or in the FAQs. This addon sets up the first feasible tableau for mixed inequalities and standard minimization problems and transfers that matrix to Mat A for LINPROG to obtain the final solution. To solve either mixed or minimization problems, the appropriate matrix with negative slack variables must be entered into matrix A. This program requires 383 bytes of memory. I estimate about 20 minutes for an inexperienced person to enter the coding. Simplex Pivoting Method: I'm working on this to make an interactive program, but my priority is rather low because there doesn't seem to be much demand for interactive programs. If you would like to see this program completed, send me an email telling me why you need it. Last Revised: 9/23/04
