TI-83 and 83 Plus ALGEBRA Programs
HOME
Update:
09/25/01
Program
Descriptions (Algebra/Calculus Toolbox)
Calculators
Main
| NAME | DESCRIPTIONS (Note: Expressions may be entered as input in all or most of the programs. In most cases, imaginary input is OK.) The programs are locked to protect them from accidental corruption...so if you want to alter one of them, download it and edit it using TI Graph Link. Then you can leave it locked or unlocked as you choose when you download it to your calculator. |
| ALINE | Graphs a line and displays the equation given 2 points. (208 Bytes) |
| CINTIC (5th degree polynomial solver) |
Solves most fifth degree polynomials* (zeros of P(x) for a fifth degree polynomial) given imaginary or complex (or real) coefficients (there must be at least one real zero since "solve()" is used to find the initial zero because there's no formula for 5th degree or above polynomials - synthetic division is then used to find the reduced (4th degree) polynomial) - results are returned on the screen and the coefficients and results are stored in L3(1)…L3(6) and L2(1)…L2(5) and for future reference - note: values previously in L1(1)…L1(6), L2(1)…L2(5) and L3(1)…L3(6) will be lost - the equation is left in Y1 so it can be graphed if the coefficients are real (you may have to use "FINDFN" to find it) - also, if statistical plotting is to be done after non-real zeros are in the statistics editor, the entire lists containing the non-real solutions must be cleared first to avoid stat plot errors - (*If the reduced equation - after the first root is found - is a depressed quartic with real coefficients, division by 0 would result because of the quartic formulas. Solve it using the substitution y = x2 and the quadratic formula or "QUADALL". The reduced 4th degree coefficients will be in L1(1)...L1(5) (the second and fourth will be 0's) and the initial solution will be given. Two pair of non-real solutions may subsequently be found - the likely culprit causing the depressed quartic.") - the quartic part of the program was developed from formulas for the solution of quartic equations (found on the Internet) (1782 Bytes) (I think there is a bug when all the coefficients are imaginary) |
| CUBIC (3rd degree polynomial solver) |
Solves cubic equations (zeros of P(x) for a third degree polynomial) given imaginary or complex (or real) coefficients - results are returned on the screen and the coefficients and results are stored in L1(1)…L1(4) and L2(1)…L2(3) for future reference - note: values previously in L1(1)…L1(4) and L2(1)…L2(3) will be lost - also, if statistical plotting is to be done after non-real numbers are in the statistics editor, the entire lists containing the non-real solutions must be cleared first to avoid stat plot errors - developed from formulas for the solution of quartic equations (found on the Internet) (523 Bytes) |
| ELLIPSE | Given the coefficients of an Ellipse equation (relation) in AX^2+CY^2+DX+EY+F=0 form, returns its parts and features along with its eccentricity...From AWL*...also does a vaoidity check (of the coefficients)...seems like a nice program...works for a circle, of course... (556 Bytes) |
| EXPBI | Expands binary factors (terms must be of the same degree...otherwise, use POLYMULT). Puts input in L6, output in L1. |
| FACTOR2 | Factors any factorable trinomial quadratic (unFOILS) or, if not factorable, detects it, and gives notification. Returns the input, the numbers for the product/sum if it were done with group factoring, and the solution as two binomials. Allows for automatic input of the last input (to avoid having to re-enter it). Puts input in L6, output in L1 and L3, and P/S in L3. |
| HYPERB | Given the coefficients of a Hyperbola equation (relation) in AX^2+CY^2+DX+EY+F=0 form, returns its parts and features along with its eccentricity...From AWL*...also does a vaoidity check (of the coefficients)...seems like a nice program...does not work for a circle, of course... (673 Bytes) |
| LINE | Accepts as input the point and slope, two points, or the A, B and C of Ax + By =C, or previous input and returns the line in Ax + By =C and y = mx + b form along with the slope. It also returns the input. Input is stored in L6. (access by STAT EDIT) |
| PARABOLA | For the A, B, C of "Y=AX2+BX+C" or the A, H, K of "Y=A(X-H)2+K", returns the vertex, focus, directrix, x-intercepts and length of the latus rectum. (1523 bytes) |
| PGETKEY | Displays "ANY KEY..." and waits for any key to be pressed before continuing - this program is normally used by many of the programs below to wait for a one character response from the user - - it eliminates the need to use the ENTER key - this program should be included if any of the other programs below are copied. (60 Bytes) |
| POLYDIV | Given rhe dividend and divisor whose coefficients have been entered as lists, the program returns the coefficients of the quotient and remainder in list form...the coefficients are entered as lists with the proper curly-que brackets..ex) x2 + 2x + 3 would be entered as {1,2,3}...From AWL*...nice program...an answer of [1} {0 1 1} = 1 + (x + 1)/divisor...might be useful for some partial fraction decomposition...From AWL*...nice program... (465 Bytes) |
| POLYFCTR | Given the degree and coefficients of a polynomial, returns the coefficients of the factors as lists...although it failed my antibomb test, it seems like it will factor most "reasonable" polynomials that are factorable...Note: Polynomials that are not reasonable are ones that are probably not factorable to begin with..in most cases the program returns the original polynomial but, in a couple of cases, it bombed our due to division by zero...From AWL*...seems like a very useful program... (1093 Bytes) |
| POLYMULT | Given any two polynomials (within reason), multiplies them and returns the coefficients in list form...the coefficients of the multiplicand and multiplier are entered as lists with the proper curly-que brackets..ex) x2 + 2x + 3 would be entered as {1,2,3}...From AWL*...nice program... (202 Bytes) |
| QUADNEW2 (2nd degree polynomial solver) |
Solves any quadratic equation (zeros of P(x)) for a second degree polynomial) given imaginary or complex (or real) coefficients - returns the solutions in fraction form if possible and in exact (radical) form if possible. Expressions (as in all programs) may be used as input. If you are the first to find and notify me of a quadratic that this won't solve or can make the program "crash" (with valid input...the program also validates input data as long as it's numeric), email me and I'll send you $5.00 (assuming it has been installed properly and is not been corrupted by you) (2112) bytes |
| QUARTIC (4th degree polynomial solver) |
Solves quartic equations* (zeros of P(x) for a fourth degree polynomial) given imaginary or complex (or real) coefficients - results are returned on the screen and the coefficients and results are stored in L1(1)…L1(5) and L2(1)…L2(4) for future reference - note: values previously in L1(1)…L1(5) and L2(1)…L2(4) will be lost - also, if statistical plotting is to be done after non-real numbers are in the statistics editor, the entire lists containing the non-real solutions must be cleared first to avoid stat plot errors - developed from formulas for the solution of quartic equations (found on the Internet) (*If the equation is a depressed quartic with real coefficients, division by 0 will result. Solve it using the substitution y = x2 and the quadratic formula or "QUAD". Two pair of non-real solutions may be subsequently found - the likely culprits causing of the depressed quartic.") (1246 bytes) |
| RADICAL | Given the radicand (inside the radical symbol), returns the rationalized radical in exact and approximate form - a very clever program, I might add...From AWL* "CHARLIE'S GREAT SIMPLIFY RADICAL PROGRAM V2.41"...I agree that it is greatly written... (1044 Bytes) |
| RADSUB | A subroutine...given a radicand (for a square root) that is not a perfect square, a line number and a column number, returns the exact answer at the specified location if it is rationalizable. Must be included since it is used by a couple of the other programs. I must admit that I stole some of the code from "CHARLIE'S GREAT SIMPLIFY RADICAL PROGRAM V2.41", which I also admit is a great program (string programming at the non-assembly level is very difficult/tricky on the TI-83). (804 Bytes) |
| SLOPE | Given two points, returns the slope, distance and midpoint (177) bytes |