Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Not sure how this works! Apparently it can be done in 5-6 multiplications

Show how to multiply two degree 2 polynomials using fewer multiplications of coefficients than the naive algorithm.

share|improve this question
add comment

1 Answer

I can't find the way using only 5-6, but here is a way to do it in $7$.

Suppose we are multiplying together $ax^2 + bx + c$ and $dx^2 + ex + f$. Compute $(a+b+c)(d+e+f) = ad + ae + af + bd + be + bf + cd + ce + cf$. This takes $1$ multiplication. Now compute $ad,ae,bd,bf,ce,cf$. This brings up up to $7$. The coefficients of the product are simply $ad, ae + bd, be + af + cd, bf + ce, cf$. By straightfoward additions we know $ad, ae + bd, bf + ce, cf$ already. This coefficient $be + af + cd$ can be computed as $(a+b+c)(d+e+f) - ad - ae - bd - bf - ce - cf$, thus we're done and we only need $7$ multiplications.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.