A polynomial in x has m nonzero terms. Another polynomial in x has n nonzero terms where m < n. These polynomials are multiplied and all like terms are combined. The resulting polynomial in x has a maximum of how many nonzero terms?
The answer shows mn but why??
The correct answer IS indeed mn. For example, we might have:
f(x) = x2+x+1
g(x) = x6+x3+1, in which case:
f(x)g(x) = x8+x7+x6+x5+x4+x3+x2+x+1, which has 9 = 3*3 terms
(it might not be possible to "combine and simplify", because there may be NO "overlap" of equal terms of xk, for any given k).
The general formula for polynomial multiplication is:
So it is tempting to think that the number of terms will not exceed m+n, but in the formula above, the number of 0 terms in the first polynomial could be fairly large, with just enough "gaps" in the non-zero terms to completely put a polynomial with the number of terms in the second polynomial "in the gaps".
As is easily verifed (you can use induction), the number of possible terms (with NO combining of "like terms", which may not exist) of a product of a sum with m summands, and a sum with n summands, is a sum with mn summnads.
Yes, I was thinking the same thing. If f(x) is a polynomial, let terms(f) denote the number of nonzero terms in f(x). I believe the statement says: For all polynomials f and g, if terms(f) < terms(g), then terms(fg) <= terms(f)terms(g), and this upper bound is sharp, i.e., the inequality turns into an equality (only) for some f, g. The fact that the inequality is strict for some f and g or even for some classes of polynomials does not refute this statement.
Show that the product of two polynomials with m and n terms, respectively, has <= mn terms. This is easy if you know how polynomials are multiplied. Then note Deveno's example where the product, after adding like terms, has exactly mn terms. Thus, saying that the product has < mn terms (instead of <= mn terms) is incorrect. So, the maximum number of terms in a product is mn. This maximum is achieved for some pairs of polynomials, and for other pairs (as in topsquark's example) it is not.
Think of the distributive law: a(b + c) = ab + ac.
Now for an example: Say your first polynomial has two terms (m = 2), ax^p + bx^q, and your second polynomial has three terms (n = 3), cx^r + dx^s + ex^t. Then
So there will be m terms that distribute and, one at a time, multiplies the n terms. So before simplification we have mn terms. (Simplifying will merely reduce the number of terms to less than mn.)
Can you work this into a proof?
Simply, in the most general case, in the most suitable conditions, each term in one of the polynomials can generate a term for each term in the other polynomial, as though you were talking about ordered pairs. So you just multiply the two.
It is easy to show that one can always pick a polynomial g(x) with n non-zero terms given a polynomial f(x) with m non-zero terms such f(x)g(x) has mn non-zero terms.
Suppose f(x) = c1xk1 + c2xk2 +...+ cmxkm, where k1 < k2 <...< km, cj ≠ 0.
Let g(x) = 1 + xkm+1 + x2km+2 +...+ x(n-1)km+n-1, for any n > m, which clearly has n non-zero terms.
then f(x)g(x) = f(x) + (xkm+1)(f(x)) + (x2km+2)(f(x)) +....+ (x(n-1)km+n-1)(f(x)).
The highest term of xjkm+j(f(x)) (for j = 0,1,...,n-2) is some (constant) multiple of xjkm+j+km = x(j+1)km+j, whereas the lowest term of
x(j+1)km+(j+1)(f(x)) is some (constant) multiple of x(j+1)km+(j+1)+k1, and:
(j+1)km+j < (j+1)km+(j+1) ≤ (j+1)km+(j+1)+k1.
Now all theses j's and k's might be confusing. Here is a concrete example:
Suppose f(x) = 1 + 3x3 + 2x5 (3 non-zero terms). To find a polynomial g(x) with 4 non-zero terms we pick:
g(x) = 1 + x6 + x12 + x18.
Then f(x)g(x) = (1 + 3x3 + 2x5) + x6(1 + 3x3 + 2x5) + x12(1 + 3x3 + 2x5) + x18(1 + 3x3 + 2x5)
As you can see the highest power of x in each grouping is less than the lowest power of x in the next grouping, so we will have 12 non-zero terms.
On the other hand, for ANY sum (polynomial or not) with m terms, say:
S = A1+...+Am, and ANY sum with n terms, say T = B1+...+Bn
ST = A1(B1+...+Bn) + A2(B1+...+Bn) +...+ Am(B1+...+Bn)
= A1B1+...+ A1Bn +...+AmB1+...+AmBn, which has mn terms (before simplification).
So the largest possible number of terms is mn, and this bound is indeed reached (for some polynomial products).