first this can be done on the TI-83/84 series but **not** in one line. Although the functions I use to do it in one line exist on the 84 they do not work quite the same way and thus it requires more then one line to do. although i would like to see the best way people can come up with on the 83/84.

second ,I have to clarify my challenge because apparently I confused some people srry about that.

Say we have 2 polynomials (we will use $11x^4-5x^2+x-2$ and $4x^2+5x-2$ as examples) and you want to multiply them together.

$(11x^4-5x^2+x-2)( 4x^2+5x-2)$

the result of this multiplication would be $44x^6+55x^5+30x^4+14x^3+x^2-8x-4$

now say that you encode the polynomials in lists starting with the highest power of x's coefficient and working our way down with each successive location being the coefficient of x to the power of one lower than the previous until we get to the constant. That may seem complicated but it's easier shown then written so here is the encoding for our examples:

11x^4-5x^2+x-2 becomes the list {11,0,5,1,-2} and

4x^2+5x-2 becomes the list {4,5,2}

assuming that your polynomials are handed to you encoded and you hand them back similarly encoded do the multiplication.

so mult({11,0,2,1,-2},{4,5,2}) yields {44,55,30,14,1,-8,-4}

are there still questions?