Synthetic Division

Start with the polynomial and its coefficient list

A polynomial is written as a sum of powers of x with numerical coefficients. For example, P(x) = 4x^5 - 3x^3 + 9x - 2 has degree 5, but it does not visibly show an x^4 term or an x^2 term. Synthetic division still needs one position for every power from x^5 down to x^0. Its coefficient list is therefore 4, 0, -3, 0, 9, -2. The zeros are not optional decoration. They preserve the place of the missing powers so that every multiplication and addition lines up with the correct term.

Read the list from highest degree to lowest degree. The first entry belongs to the highest power, the next entry belongs to the next power, and the last entry is the constant term. For 2x^3 + 7x^2 - x + 5, enter 2, 7, -1, 5. For x^3 - 6x^2 + 11x - 6, enter 1, -6, 11, -6. A minus sign belongs to the coefficient it changes; it is not a separator and it must not be dropped when the values are typed.

If a polynomial has degree n, its ordinary coefficient list has n + 1 positions. A quadratic needs three entries, a cubic needs four, and a fourth-degree polynomial needs five. The calculator asks for at least two finite numbers because a one-entry list does not describe a division problem by a linear factor. A leading coefficient should normally be nonzero when you want the degree stated in the usual way. A leading zero is mathematically removable, so delete it for a clearer representation rather than relying on an extra empty-looking degree.

The input is a list of numbers, not a typed polynomial expression. Do not enter x characters, exponent marks, or a full equation in the coefficient field. Translate the expression first, write down every power in order, insert zero for every absent power, and then enter that finished list. This small preparation step prevents most downstream errors because the row can only be correct when its starting positions are correct.

• List coefficients from the highest power through the constant term.
• Insert 0 for every missing power between the highest and lowest terms.
• Keep the sign attached to each coefficient.
• A degree n polynomial normally has n + 1 coefficient positions.
• Enter numbers only, rather than an expression containing x.

Read the divisor x - c correctly

The number used in the synthetic row is c, the number that appears after the minus sign in x - c. If the divisor is x - 3, then c = 3. If the divisor is x - 8, then c = 8. The value is used exactly as written in the row operations: each intermediate result is multiplied by c before it is added to the next coefficient.

A plus sign in the displayed divisor hides a negative root value. The expression x + 1 is the same as x - (-1), so its c is -1. Likewise, x + 4 means c = -4. Entering 1 for x + 1 would test the wrong factor, x - 1. Parentheses make the relationship easier to see: x + 1 = x - (-1). The sign of c is part of the mathematics, not merely a formatting choice.

The value c is also the number at which the polynomial is being tested. If P(c) is zero, then c is a root and x - c is a factor. This is why the divisor and root fields are connected. The calculator labels the input as the divisor root to remind you that the root is c, not the entire divisor and not the opposite of c. For x - 5 the root is 5; for x + 5 the root is -5.

Synthetic division in this form is for a monic linear divisor, meaning the coefficient of x is 1. A divisor such as 2x - 4 has the same root as x - 2, but it is not literally the same divisor. Using c = 2 on this page performs division by x - 2. If the original question specifically requires division by 2x - 4, account for the extra factor of 2 when interpreting the quotient.

• For x - 3, use c = 3.
• For x + 1, rewrite it as x - (-1) and use c = -1.
• The tested value c is the possible root of P(x).
• The page directly represents a divisor x - c with leading coefficient 1.
• Do not replace c with its opposite just because the divisor contains a minus sign.

The bring-down, multiply, and add process

Place c beside the coefficient list. The first coefficient is brought down without a multiplication. That value becomes the first quotient coefficient. Next multiply the value just written by c. Put the product under the next original coefficient, then add the two values. The sum becomes the next number in the synthetic row. Repeat multiplication by c and addition with each remaining coefficient. The final sum is not another quotient coefficient; it is the remainder.

For a coefficient list a, b, d, e and a chosen c, the row begins by bringing down a. Multiply a by c and add the product to b. Multiply that new sum by c and add to d. Multiply the next sum by c and add to e. The resulting row has three values before the final value: those first three values describe the quotient, and the last value is the remainder. The pattern is simple, but the order matters at every step.

The operation is always multiply by c, not multiply by the next coefficient and not multiply by the whole divisor. Addition is performed with the original coefficient in the same column. A useful handwritten layout has the original coefficients in one line, products in a line below them, and running sums in a line where the quotient is read. Keeping products and sums visually separate makes negative signs easier to audit.

There is one fewer quotient coefficient than original coefficient. A degree-three polynomial has four starting coefficients and produces three quotient coefficients plus a remainder. A degree-five polynomial has six starting coefficients and produces five quotient coefficients plus a remainder. If your row appears to have the same number of quotient values as the original list, the final value has probably been included by mistake.

The first bring-down step is the only operation that does not multiply. Every later column follows the same rhythm: multiply the previous row value by c, add that product to the next original coefficient, and carry the sum forward. Repeating one rhythm is the main advantage of the method. It turns a polynomial division into a short sequence of arithmetic checks rather than a changing collection of long-division terms.

• Bring down the first coefficient unchanged.
• Multiply the running value by c.
• Add that product to the next original coefficient.
• Use each new sum as the next running value.
• Treat the last sum as the remainder, not as a quotient coefficient.

What the quotient and remainder mean

If P(x) is divided by x - c, the result can be written as P(x) = (x - c)Q(x) + R. Here Q(x) is the quotient polynomial and R is a constant remainder. The first values in the synthetic row are the coefficients of Q(x), in descending powers. The final value is R. This identity is the best way to connect the compact row to ordinary polynomial division.

The quotient has degree one less than P when the leading coefficient is nonzero. If P is cubic, Q is quadratic. If P is fourth degree, Q is cubic. Build Q from the row values in the same descending-power order used for the original list. For example, row values 3, 6, 7, 14 before a final 35 represent Q(x) = 3x^3 + 6x^2 + 7x + 14 and R = 35.

A zero remainder means the division is exact: P(x) = (x - c)Q(x). A nonzero remainder means the factor does not divide P exactly, but the division is still valid. The remainder is the constant amount that must be added after multiplying the divisor by the quotient. It is not an error message and it does not mean that the arithmetic failed. It reports the leftover value for that divisor.

The page returns quotient coefficients rather than a formatted polynomial with powers. That representation is useful because it preserves the same ordering convention as the input. Reconstructing the powers is straightforward: the first returned quotient value belongs to one degree below the original highest degree, and each later value belongs to the next lower degree. The remainder stands apart after the quotient list.

• Division identity: P(x) = (x - c)Q(x) + R.
• The first row values are quotient coefficients in descending order.
• The final row value is the constant remainder.
• R = 0 means exact division and a factor; R not equal to 0 means a nonzero leftover.
• The quotient degree is one lower than the original degree in the ordinary case.

Worked example: a positive root that is a factor

Take P(x) = x^3 - 6x^2 + 11x - 6 and divide by x - 1. The coefficient list is 1, -6, 11, -6, and c = 1. Bring down the first value 1. Multiply 1 by 1 to get 1, then add it to -6 to get -5. The running value is now -5.

Continue the row. Multiply -5 by 1 to get -5 and add it to 11, producing 6. Multiply 6 by 1 to get 6 and add it to -6, producing 0. The row values are 1, -5, 6, 0. The quotient coefficients are 1, -5, 6, so Q(x) = x^2 - 5x + 6. The last value is R = 0.

The division identity is P(x) = (x - 1)(x^2 - 5x + 6) + 0. Because the remainder is zero, x - 1 is a factor and 1 is a root. The quotient can be factored further as (x - 2)(x - 3), so the original polynomial has roots 1, 2, and 3. Synthetic division performed only the first exact division; the additional factoring is a separate step.

There are two quick checks. First, evaluate P(1): 1 - 6 + 11 - 6 = 0, matching the remainder. Second, multiply (x - 1)(x^2 - 5x + 6). The product is x^3 - 6x^2 + 11x - 6, which restores the starting polynomial. These checks confirm both the arithmetic row and the interpretation of its final value.

• Input coefficients: 1, -6, 11, -6; c = 1.
• Running sums: 1, -5, 6, 0.
• Quotient: x^2 - 5x + 6.
• Remainder: 0, so x - 1 is a factor.
• Direct evaluation gives P(1) = 0 as an independent check.

Worked example: missing coefficients must become zero

Consider P(x) = 3x^4 - 5x^2 + 7 divided by x - 2. The expression has no x^3 term and no x term. Because the highest power is x^4, write every position from x^4 through x^0: 3, 0, -5, 0, 7. Use c = 2. Omitting either zero would shift all later coefficients into the wrong powers and change the polynomial being divided.

Bring down 3. Multiply 3 by 2 to get 6 and add to the next coefficient 0, giving 6. Multiply 6 by 2 to get 12 and add to -5, giving 7. Multiply 7 by 2 to get 14 and add to the next coefficient 0, giving 14. Finally, multiply 14 by 2 to get 28 and add to 7, giving 35.

The synthetic row is 3, 6, 7, 14, 35. The quotient coefficients are 3, 6, 7, 14, which produce Q(x) = 3x^3 + 6x^2 + 7x + 14. The remainder is 35. Since the remainder is not zero, x - 2 is not a factor of this polynomial.

The Remainder Theorem gives a particularly easy check. Evaluate the original polynomial at 2: 3(2^4) - 5(2^2) + 7 = 3(16) - 5(4) + 7 = 48 - 20 + 7 = 35. The value agrees with the final row entry. Reconstructing the full identity also works: (x - 2)(3x^3 + 6x^2 + 7x + 14) + 35 expands back to 3x^4 - 5x^2 + 7.

This example is useful because the zeros are visible in the result. If you entered 3, -5, 7 instead, you would actually be asking the calculator to divide 3x^2 - 5x + 7 by x - 2. That is a different polynomial and would produce a different quotient and remainder. Missing powers must be represented before the text reaches the calculator.

• Polynomial: 3x^4 - 5x^2 + 7.
• Correct list: 3, 0, -5, 0, 7.
• With c = 2, the row is 3, 6, 7, 14, 35.
• Quotient: 3x^3 + 6x^2 + 7x + 14; remainder 35.
• Direct evaluation confirms P(2) = 35.

Worked example: a negative root and negative products

Now divide P(x) = 2x^3 + x^2 - 4x - 3 by x + 1. The divisor must first be read as x - (-1), so c = -1. The coefficient list is 2, 1, -4, -3. Bring down 2. Multiply 2 by -1 to get -2, then add to 1 to get -1.

Multiply the new running value -1 by -1 to get 1, then add to -4 to get -3. Multiply -3 by -1 to get 3, then add to the last coefficient -3 to get 0. The row is 2, -1, -3, 0. The quotient is Q(x) = 2x^2 - x - 3 and the remainder is zero.

The result says P(x) = (x + 1)(2x^2 - x - 3). The signs are consistent even though the divisor is written with a plus sign. Evaluating the original polynomial at -1 gives 2(-1)^3 + (-1)^2 - 4(-1) - 3 = -2 + 1 + 4 - 3 = 0. Thus -1 is the root, and x + 1 is the corresponding factor.

For a negative root that is not a factor, take P(x) = x^3 - 2x + 5 and c = -2, so the divisor is x + 2. Use the complete list 1, 0, -2, 5. Bring down 1; multiply by -2 and add to 0 to get -2; multiply -2 by -2 and add to -2 to get 2; multiply 2 by -2 and add to 5 to get 1. The quotient is x^2 - 2x + 2 and the remainder is 1. Direct evaluation gives P(-2) = -8 + 4 + 5 = 1, so the nonzero result is correct.

Negative multiplication is not a special version of the method. It follows the ordinary sign rules at each step. The important protection is to identify c before starting. Once c is correctly set to a negative number, bring-down, multiply, and add work exactly as they do for a positive root.

• For x + 1, use c = -1, not c = 1.
• Row for 2x^3 + x^2 - 4x - 3: 2, -1, -3, 0.
• Quotient: 2x^2 - x - 3; remainder 0.
• For x^3 - 2x + 5 at c = -2, the remainder is 1.
• Check a negative-root result by evaluating the original polynomial at the negative value.

The Remainder Theorem and polynomial evaluation

The Remainder Theorem states that when P(x) is divided by x - c, the remainder is P(c). Synthetic division makes this theorem visible because its last running sum is produced by the same nested arithmetic used to evaluate the polynomial at c. A nonzero final row value is therefore not merely leftover division; it is the polynomial's value at the tested number.

Suppose the coefficient list is 5, -2, 0, 7 and c = -2. Bring down 5. Multiply by -2 and add to -2 to get -12. Multiply -12 by -2 and add to 0 to get 24. Multiply 24 by -2 and add to 7 to get -41. The final number is P(-2). Evaluating directly gives 5(-2)^3 - 2(-2)^2 + 0(-2) + 7 = -40 - 8 + 7 = -41.

The process is also called nested or Horner-style evaluation when the goal is to compute a value rather than to emphasize division. The same row simultaneously produces a quotient if you interpret all but the last entry as quotient coefficients. This dual purpose is one reason synthetic division is efficient: one sequence of multiply-and-add operations can test a candidate root and prepare the polynomial left after that factor is removed.

Evaluation by the row avoids calculating every power separately. Instead of finding c^3, c^2, and c one at a time, you start with the leading coefficient and repeatedly multiply the accumulated value by c before adding the next coefficient. This can reduce arithmetic clutter in a hand calculation. It does not change the answer, and it still depends on entering every coefficient position, including zeros for absent powers.

The theorem applies to any finite c that belongs to the page's input contract, whether the value is positive, zero, or negative. It does not say that every c is a root. It says that P(c) is exactly the remainder for the divisor x - c. Only when that value equals zero does the root and factor conclusion follow.

• Remainder Theorem: the final row value equals P(c).
• A zero final value means the tested c is a root.
• Nested multiply-and-add evaluation avoids separate power calculations.
• The same row gives both P(c) and the quotient coefficients.
• Missing coefficients still require zero positions during evaluation.

The Factor Theorem and a systematic root test

The Factor Theorem is the zero-remainder version of the Remainder Theorem. It says that x - c is a factor of P(x) exactly when P(c) = 0. In a synthetic row, that condition is visible in the last entry. If the final number is zero, record c as a root and the preceding row values as the coefficients of the polynomial that remains after removing x - c.

This gives a practical way to test several candidate roots. Choose a candidate c, perform the row, and inspect the final value. A zero result confirms the candidate. A nonzero result rejects that candidate as a root, although it still provides the exact value P(c). The calculator does not generate candidate values or decide which ones are worth testing, so the selection step comes from the problem, an algebraic pattern, or a separate theorem.

For polynomials with integer coefficients, the Rational Root Theorem can narrow a list of rational candidates. In reduced form p/q, a possible rational root has p dividing the constant term and q dividing the leading coefficient. This rule supplies candidates; it does not prove that every candidate works. Synthetic division is then a fast exact-style test for each candidate within the limits of the entered numeric values.

When a candidate succeeds, repeat the process on the quotient if you want to continue factoring. If the same c produces a zero remainder again on the quotient, the factor can occur more than once. For example, repeated success at c = 2 indicates another copy of x - 2 remains in the reduced polynomial. This calculator performs one division per calculation, so repeated-factor analysis requires a deliberate second calculation using the returned quotient coefficients.

A zero remainder does not automatically reveal all of the polynomial's roots. It proves one factor and gives the quotient. The quotient may have additional real roots, repeated roots, or complex roots. Continue only when the remaining polynomial and the purpose of the problem justify it.

• Factor Theorem: x - c is a factor exactly when the remainder is zero.
• Use one candidate value at a time and inspect the final row entry.
• The Rational Root Theorem suggests candidates but does not verify them.
• Run the quotient again to investigate repeated copies of the same factor.
• One successful test does not factor the entire polynomial automatically.

Text parsing, finite values, and validation

The coefficient field is text because a polynomial may need many values and may include spaces or commas. The page accepts separators made from commas or whitespace, so entries such as 1, -6, 11, -6 and 1 -6 11 -6 describe the same list. A complete token must be a decimal-style number with an optional sign and an optional exponent. Scientific notation such as 2e3 or -4.5e-2 is useful when a coefficient is easier to read in powers of ten.

The parser rejects a blank field and rejects a list with fewer than two numbers. It also rejects missing entries beside commas. A trailing comma, a leading comma, or two commas with only spaces between them signals that a coefficient is absent. Fix the list by inserting the intended numeric value, often 0 for a missing polynomial power, rather than expecting the parser to guess what was meant. Whitespace by itself is a valid separator, so a list separated only by spaces does not create an empty token.

Each parsed coefficient must be finite and must lie from -1,000,000,000,000 through 1,000,000,000,000. Finite means it is an ordinary numeric value, not infinity or not-a-number. The text must contain numbers rather than expressions, units, variable names, fractions written with a slash, or arithmetic such as 2 + 3. The field also has a maximum text length of 32,000 characters and a maximum of 1,000 numbers. These limits keep an accidental paste or an unbounded list from becoming an impractical calculation.

The root field follows a separate rule. It must be a finite number, but it is not restricted to the coefficient range. It can be positive, zero, or negative, and it may be fractional or written as a decimal. It cannot be blank, infinite, or not-a-number. The divisor remains x - c even when c is a fraction or a negative value. Complex roots cannot be entered in this number field because they are not ordinary real numeric inputs.

Validation checks the shape and range of the input; it does not prove that the coefficients came from the polynomial you intended. It also does not infer units or simplify an expression. A list can be syntactically valid and still represent the wrong polynomial if a sign or zero was omitted. Read the original expression beside the finished list before calculating, then treat any validation message as a prompt to repair the input rather than as permission to substitute a nearby value.

• Commas and whitespace can separate coefficient values.
• Scientific notation is allowed when it forms a complete finite number.
• Blank entries beside commas, expressions, units, and variable names are rejected.
• Coefficients are limited to finite values from -1e12 through 1e12 and at most 1,000 numbers.
• The coefficient text is limited to 32,000 characters.
• The root must be finite but may be any real numeric value accepted by the form.

Verify the result before using it

A short independent check can catch an incorrect coefficient list even when the row arithmetic was performed perfectly. Start with the Remainder Theorem: evaluate the original polynomial at c and compare that value with the displayed remainder. This is especially useful for a negative c, a polynomial with missing powers, or a list containing several negative coefficients. If the two values disagree, revisit the translation from polynomial expression to coefficient list before questioning the row.

A second check is the division identity P(x) = (x - c)Q(x) + R. Rebuild Q(x) from the returned quotient coefficients, multiply it by x - c, and add the constant remainder. Expanding the result should restore every original power with its original coefficient. You do not need to expand every term for a quick review; checking the highest term, one middle term, and the constant term can expose a misplaced zero or sign.

Check the number of outputs as well. A list with n + 1 original coefficients should yield n quotient coefficients and one remainder. The quotient should begin one power below the original leading term. If the first quotient coefficient does not match the original leading coefficient, the first number may not have been brought down correctly. If the last number is being used as a quotient term, the remainder has been misread.

Finally, check the interpretation rather than just the arithmetic. A zero remainder supports the statement that x - c is a factor. A nonzero remainder supports only the statement that c is not a root for this polynomial and that P(c) has the displayed nonzero value. Do not round a small nonzero remainder to zero without considering the precision of the inputs and the purpose of the conclusion.

• Evaluate P(c) and compare it with the final row value.
• Reconstruct P(x) from (x - c)Q(x) + R when the result matters.
• Confirm that the quotient has one fewer coefficient than the input list.
• Check the first quotient coefficient and the constant term for alignment.
• Do not turn a nonzero remainder into zero merely because it looks small.

Common mistakes and how to avoid them

The most common mistake is reversing coefficient order. Synthetic division does not accept the constant term first. If P(x) = 2x^3 - 5x + 4, the correct list is 2, 0, -5, 4. Entering 4, -5, 0, 2 describes a different polynomial and can still produce a perfectly finite row, which makes the error easy to miss. Always annotate the powers above the list once before typing it.

The next common mistake is skipping a missing coefficient. In 7x^4 + 3x^2 - 1, the list is 7, 0, 3, 0, -1. The first zero represents x^3 and the second represents x. Removing either one moves later values left and changes both the degree positions and the answer. Missing terms are represented by zero, not by a shorter list.

Sign confusion in the divisor causes many false root tests. For x + 2, c is -2. For x - (-2), c is also -2. Entering 2 tests x - 2 instead. When the divisor contains a plus sign, rewrite it with subtraction and parentheses before starting. Then use the same signed c in every multiplication; do not change the sign after the first step.

Another mistake is multiplying by the wrong item. The repeated multiplier is c, while the number being added is the next original coefficient. Multiplying by a coefficient can produce a row that looks structured but has no connection to the division identity. Write c at the side of the row and refer back to it for every product.

Some readers also treat the final row value as part of the quotient. It is not. In a cubic division, the first three row values form a quadratic quotient and the fourth is the remainder. A zero final value is still a remainder; it should be reported as zero because that is the evidence for a factor.

Finally, do not confuse a root with a divisor string. The number c is the root being tested. The factor is x - c. A root of -3 corresponds to x + 3, not x - 3. Keeping these names separate makes it much easier to explain a result to another reader and to use the returned remainder in a theorem.

• Descending powers, not ascending powers, determine input order.
• Missing terms require explicit zeros.
• For x + k, the root value is c = -k.
• Multiply by c at every step and add to the next original coefficient.
• The final row entry is always the remainder.
• A root is a number; its corresponding factor is x - c.

Practical uses beyond one division exercise

Synthetic division is useful whenever a polynomial must be tested or reduced by a known linear factor. In a classroom, it gives a quick way to verify a proposed root and to practice the connection between division and factoring. In algebra work, it can remove a known factor before a quadratic formula, another root test, or a second factorization step is attempted.

It is also a convenient evaluation method. If you need P(c) for several candidate values, the nested multiply-and-add process avoids writing out every power separately. The final value tells you the polynomial's output at the chosen input, while the earlier values provide the quotient if the candidate happens to be a root. This makes one row useful for both numerical inspection and symbolic reduction.

In numerical work, polynomials often appear as approximations, interpolation formulas, recurrence calculations, or compact models. A transparent multiply-and-add evaluation can be easier to audit than a long expression with repeated powers. The calculator is suitable for a first check of such arithmetic when the coefficient list and c are known and remain within the supported finite numeric range.

Synthetic division can help organize repeated root searches. A problem may provide a list of plausible roots from symmetry, a known factorization pattern, or an integer-root rule. Test each candidate, record the remainder, and continue only with candidates that return zero. Keeping the candidate, coefficient list, and remainder together creates an auditable trail instead of relying on a guessed factor.

The method is practical because it is compact, but compact does not mean automatic. It does not decide whether a root is meaningful in an application, whether a model is appropriate, or whether a small numerical difference matters. Use it to establish a polynomial arithmetic fact, then combine that fact with the context of the question.

• Check a proposed linear factor quickly.
• Reduce a polynomial before solving the remaining factor.
• Evaluate P(c) using nested multiplication.
• Screen candidate rational roots with a documented remainder.
• Audit arithmetic in interpolation, recurrence, and other polynomial calculations.
• Keep mathematical verification separate from decisions about an applied model.

Limitations and when another method is better

The calculator handles one division by a monic linear factor x - c. It does not divide directly by a quadratic such as x^2 + 1, a factored expression with several factors, or a general polynomial divisor. If the divisor is not linear, use polynomial long division or another method designed for that divisor. If a divisor is a scaled linear expression such as 2x - 4, recognize that the page's direct quotient is for x - 2 and adjust for the scale when the original divisor matters.

All coefficients and the root are treated as finite real numbers. The page does not accept symbolic coefficients, variables inside the text, or complex roots. It also does not simplify fractions symbolically, preserve exact radicals, or prove exactness beyond the numeric values it receives. Decimal arithmetic can contain ordinary rounding effects, especially when coefficients are very large, very small, or close to values that would make a remainder appear nearly zero.

One calculation performs one synthetic division. It does not automatically find every root, factor the quotient, identify multiplicities, or select candidate values. A zero remainder proves one factor, but the remaining quotient may need a different technique. A nonzero remainder rejects one candidate only; it does not describe the shape of the polynomial everywhere else.

Input validation protects the finite text calculation but cannot protect against a wrong mathematical transcription. A valid list can omit a needed zero, reverse the order, or use a sign that belongs to another term. Similarly, a finite c can be unrelated to the divisor you intended. The tool has no access to the original equation or the reason you chose a root, so those checks remain part of your workflow.

For high-consequence work, preserve the original polynomial, the exact divisor, the entered list, and an independent check. If a conclusion depends on distinguishing a tiny nonzero remainder from zero, use higher-precision or symbolic arithmetic appropriate to the problem. The calculator is a clear arithmetic aid, not a replacement for exact algebra when exactness is essential.

• Supported divisor: one monic linear factor x - c.
• Not supported directly: quadratic or higher-degree divisors.
• Inputs are finite real numbers, not symbolic or complex expressions.
• One calculation removes at most one linear factor.
• Finite and valid input does not guarantee correct transcription or exact symbolic precision.
• Use an independent or higher-precision method when a tiny remainder controls an important conclusion.

A repeatable workflow for reliable results

Begin by copying the polynomial into a temporary written line and marking each power from the highest degree down to zero. Fill every missing power with zero. Then rewrite the divisor as x - c, including parentheses if c is negative. This two-line setup separates interpretation from arithmetic and gives you something to compare with the fields after they are filled.

Enter the coefficient list using commas or spaces, enter the signed c value, and calculate. Follow the row from left to right rather than trusting only the final display. Say each operation aloud or write it down: bring down, multiply by c, add to the next coefficient. This is slower than guessing for a single row but faster than repairing an unnoticed sign error later.

Read the first n row values as the quotient coefficients and the final value as the remainder. If the remainder is zero, write the factor conclusion as x - c is a factor and c is a root. If it is nonzero, write P(c) equals that remainder and stop short of calling c a root. The wording should match the evidence returned by the row.

Finish with a check suited to the problem. Evaluate P(c) directly, reconstruct the division identity, or run a second method. For a polynomial with missing terms or a negative root, use at least one direct substitution check. Save the coefficient order and the sign of c with the result so the calculation remains understandable when you revisit it.

• Write all powers and insert missing zeros.
• Rewrite the divisor as x - c and preserve the sign of c.
• Follow bring down, multiply, and add across the row.
• Separate quotient coefficients from the final remainder.
• Check P(c) or the full division identity before drawing a factor conclusion.

Frequently asked questions

Q: What exactly should I enter for a polynomial such as x^4 - 3x + 2? A: Enter 1, 0, 0, -3, 2. The four-degree polynomial has positions for x^4, x^3, x^2, x, and the constant. The two missing powers receive zeros, and the coefficient of x^4 is 1 even though it is not printed in the expression.

Q: Is the root for x + 5 equal to 5? A: No. Rewrite the divisor as x - (-5), so c = -5. The root is -5. A synthetic row using c = 5 would test the separate divisor x - 5 and would answer a different question.

Q: Why is the first coefficient brought down without multiplying? A: The leading coefficient becomes the leading coefficient of the quotient because the divisor is monic. The first multiplication starts only after that value has been carried into the row. Every later running value is multiplied by c before it is added to the next original coefficient.

Q: Why does the last number count as the remainder? A: Dividing a degree n polynomial by a linear factor leaves a quotient of degree n - 1 and a constant remainder. The row therefore has n quotient values followed by one final value. The last value also equals P(c), which is the Remainder Theorem check.

Q: Does a remainder of zero mean the whole polynomial is solved? A: No. It proves that x - c is one factor and supplies the quotient left after removing it. The quotient may still need to be factored or solved. If you test the same root again on the quotient and get zero again, that provides evidence of a repeated factor.

Q: Can I divide by x^2 + 1 with this calculator? A: No. Synthetic division here is specialized to a divisor x - c. A quadratic divisor requires polynomial long division or another quadratic-divisor method. Do not enter one of the quadratic coefficients as c, because that would not represent the intended divisor.

Q: Can I use a fraction or a decimal as the root? A: Yes, if it is entered as a finite number accepted by the form. A value such as 0.5 is a valid real c and represents the divisor x - 0.5. The coefficient text also supports complete decimal-style numbers, including scientific notation, but it does not evaluate a fraction expression written with a slash.

Q: Why do I get a nonzero remainder when the result looks almost like zero? A: The row is reporting the arithmetic value for the numbers entered. A small nonzero value may come from decimal rounding or from a candidate that is not an exact root. Check the original coefficient list, evaluate P(c), and consider whether exact or higher-precision arithmetic is required before rounding that value to zero.

Q: Can a leading coefficient be zero? A: The parser accepts numeric zero, but a leading zero is usually a sign that the polynomial was not reduced to its actual degree. Remove unnecessary leading zeros for a clearer quotient interpretation. Zeros between nonzero terms are different: they are required to represent missing powers.

Q: Does the calculator find roots for me? A: No. You supply c, and the row tells you whether that value is a root by returning the remainder. You can use algebraic structure or a root-candidate rule to choose values, then test them one at a time. A zero remainder identifies a successful candidate but does not search the whole number line.

Q: What should I report with a synthetic-division answer? A: Include the original coefficient order, the divisor x - c, the quotient coefficients or quotient polynomial, and the remainder. If the remainder is zero, state the factor and root conclusion. If the result is used in a larger calculation, include an evaluation or reconstruction check so another reader can see how the conclusion was established.

• Missing powers are represented by internal zeros; omitted leading 1 coefficients still need to be entered.
• A plus sign in the divisor means a negative c.
• The final row value is both the remainder and P(c).
• Zero remainder proves one factor, not a complete factorization.
• The calculator tests a supplied root; it does not discover roots automatically.
• Report coefficient order, divisor, quotient, remainder, and a check when clarity matters.