Works on :  TI-83+, TI-83+ SE, TI-84+, TI-84+ SE, TI-84+ emulator on the TI-Nspire.

At the bequest of an old friend of mine, I fished out my really old Synthetic Division program. I was intending to fix it up and ship it off, but when I saw the code, I realized how much of a mess it was. So I started over. This program started off as a Polynomial Division Utility, but it evolved into a suite for doing all four standard operations with polynomials. The algorithms are brand new, and optimized with help from an old high school friend.

This program can theoretically handle polynomials of infinite size, but, of course, bounded by your memory. See the speed test information at the bottom. It can also handle fractional coefficients. The input occurs in descending exponent order, where the calculator will first prompt you for the number of terms in the polynomial, so for x^3+x-1, you say '4' (without the single quotes   ). You will then be prompted for the coefficients. You would input 1 for exponent 3, 0 for exponent 2, 1 for exponent 1, and -1 for exponent 0. Repeat this procedure for the second operand. Alternatively, for either operand, you may enter a value of '-1', '-2', or '-3' (without the single quotes   ). '-1' loads the last Operand 1 you used, '-2' loads the last Operand 2, and '-3' loads the last result. You may supply either of these three arguments at either operand prompt without issue.

Speed Test

DISCLAIMER: This speed test was conducted on my own hardware, a TI-84+ SE, running OS 2.43. While you may experience results close to this, no two pieces of hardware are exactly alike.

for Multiplication
a 19-term times a 19-term: done in 3.35 seconds.
a 37-term times a 37-term: done in 7.52 seconds.
a 73-term times a 73-term: done in 16.94 seconds.

for Division:
a 73-term divided by a 37-term: done in 7.39 seconds.
a 37-term divided by a 19 term: done in 3.21 seconds.
a 19-term divided by a 9-term: done in 1.88 seconds.

ha, sounds nice! is it for the 84+?

Update: I just finished an update to this program that adds an input parser to the polynomial inputs. Gone is the system where you input the number of terms, then input the coefficients one-by-one. In its place, you simply input the polynomial...as a string. The program parses it and builds the lists.

Also, instead of rendering as a list, I created a list parser that converts the result back into a string, containing the polynomial. Currently testing the heck out of it. Will upload when I get my computer back from the apple store.

UPDATED PROGRAM

As of this version, you may input polynomials directly as you see them, not by lists or by inputting coefficients one-by-one. For instance, you may type in x^2+2x+1 as operand 1 and x+1 as operand 2 and the program will function as it did in the prior version. The output has been similarly changed. Please note, however, that negative exponents and fractional exponents are not supported.

I successfully reproduced it. Currently fixing.


Edit: Fixed.

Thanks. Better yet, I'm trying to design an asm version. Can someone help me out with routines for all 4 operations... multiplying, adding, dividing, and subtracting 16.8 fixed point numbers...?

Yes, that's why im looking for 16.8 numbers (where 16-bits are the integer part and 8-bits are the decimal part).

Would you make the program have some hook then and call at some function on the homescreen (like symbolic)? That would be epic!