Coefficients of Product of Two Polynomials
Jump to navigation
Jump to search
![]() | This article is complete as far as it goes, but it could do with expansion. In particular: results needed for multiple variables and multiple polynomials You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Expand}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Theorem
Let $R$ be a commutative ring with unity.
Let $f, g \in R \sqbrk x$ be polynomials over $R$.
For a natural number $n \ge 0$, let:
- $a_n$ be the coefficient of the monomial $x^n$ in $f$.
- $b_n$ be the coefficient of the monomial $x^n$ in $g$.
As an indexed summation
The coefficient $c_n$ of $x^n$ in $f g$ is the sum:
- $c_n = \ds \sum_{k \mathop = 0}^n a_k b_{n - k}$
As an indexed summation bounded by degrees
Let $\deg f$ and $\deg g$ be their degrees.
The coefficient $c_n$ of $x^n$ in $fg$ is the sum:
- $c_n = \ds \sum_{k \mathop = n - \deg g}^{\deg f} a_k b_{n - k}$
Proof
![]() | This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |