About

Polynomial multiplication errors compound through every subsequent step of an algebraic derivation. A sign mistake in one partial product propagates into incorrect roots, wrong graph intersections, and failed proofs. The box method (also called the area model or grid method) decomposes the multiplication P(x) × Q(x) into a matrix of monomial products, making every partial product visible and auditable. This calculator parses two polynomials of arbitrary degree, constructs the full distribution grid, and collects like terms by degree to produce the expanded product. It assumes coefficients in R and non-negative integer exponents.

Manual box-method work on paper becomes unwieldy past degree 3 × 3 grids. Misaligning columns or forgetting a cell is the most common source of error. This tool generates every cell programmatically, highlights like-term groups by color, and displays the simplified result. Note: this tool does not factor or simplify beyond collecting like terms. Coefficients are rounded to 6 decimal places to avoid floating-point display artifacts.

Formulas

The box method computes the product of two polynomials by distributing every term of the first polynomial across every term of the second. Given two polynomials:

P(x) = m∑i=0 a_i xⁱ

Q(x) = n∑j=0 b_j x^j

Each cell in the box at row i, column j contains the partial product:

C_i,j = (a_i ⋅ b_j) x^{i + j}

The final product is obtained by collecting like terms across all cells. For each target degree k in the result:

c_k = ∑i + j = k a_i ⋅ b_j

Where a_i = coefficient of xⁱ in P, b_j = coefficient of x^j in Q, m = degree of P, n = degree of Q, and the result degree = m + n. The total number of cells is (m + 1) × (n + 1).

Reference Data

Multiplication Type	Polynomial 1	Polynomial 2	Grid Size	Result Degree	Total Cells
Monomial × Monomial	3x	5x²	1 × 1	3	1
Monomial × Binomial	2x	x + 3	1 × 2	2	2
Binomial × Binomial (FOIL)	x + 2	x + 3	2 × 2	2	4
Binomial × Trinomial	x − 1	x² + x + 1	2 × 3	3	6
Trinomial × Trinomial	x² + 2x + 1	x² − x + 3	3 × 3	4	9
Difference of Squares	a + b	a − b	2 × 2	2	4
Perfect Square Trinomial	x + 5	x + 5	2 × 2	2	4
Quartic Product	x² + 1	x² − 1	2 × 2	4	4
Cubic × Linear	x³ + 2x² − x + 4	x − 2	4 × 2	4	8
Quintic Product	x³ + x + 1	x² − 2	3 × 2	5	6
Large Grid	x⁴ + x³ + x² + x + 1	x³ − 1	5 × 2	7	10
Constant × Polynomial	7	x² − 3x + 2	1 × 3	2	3

Frequently Asked Questions

FOIL (First, Outer, Inner, Last) only works for exactly two binomials, producing 4 partial products. The box method generalizes to any polynomial sizes. A trinomial times a quadrinomial produces a 3×4 grid with 12 cells. FOIL is a special case of the box method where the grid is 2×2.

The polynomial x³ + 1 actually has implicit zero coefficients: 1x³ + 0x² + 0x + 1. This calculator parses only the terms you provide and correctly handles gaps. The box grid will show only the non-trivially-present terms as headers (x³ and 1), keeping the grid compact. All partial products and like-term collection remain correct.

Yes. Coefficients can be any real number including negatives and decimals. Input -3.5x² + 0.25x - 7 is valid. The box cells will display signed products, and the color-coding of like terms helps track how positive and negative partial products combine during collection.

Cells that produce the same power of x are like terms and must be added together. In the box grid, these cells lie along anti-diagonals (top-right to bottom-left). The calculator assigns matching colors to cells with the same resulting degree, so you can visually verify which partial products combine into each coefficient of the final answer.

The tool accepts polynomials up to degree 20 with up to 21 terms each, producing a maximum grid of 21×21 = 441 cells. Beyond degree 10×10, the grid becomes difficult to display on mobile screens. The computation itself is trivial for modern browsers at any reasonable polynomial size.

The box method is a systematic visual application of the distributive property a(b + c) = ab + ac. Each row of the box distributes one term of the first polynomial across all terms of the second. The grid ensures no product is missed. Summing along anti-diagonals then collects like terms, which is equivalent to the Cauchy product of the coefficient sequences.