Polynomial Remainder and Factor Checker


Evaluate a real polynomial at a chosen value a to find the remainder on division by (x-a).

Use consistent units. Enter numbers without thousands separators. Invalid input clears all results.

Inserisci i valori:

1 to 51 coefficients, including zeros for missing powers.

Use a=-2 for divisor x+2.

Risultati:

Inputs and results

Choose the matching mode, then read each field label and note. Results use the same length, time, currency or quantity units as the inputs unless a label says otherwise. A negative change means a decrease.

Formula

Remainder theorem: dividing f(x) by x-a leaves remainder f(a). Horner recurrence evaluates the polynomial with b0=c0 and bi=ci+a b(i-1). The intermediate values are the quotient coefficients.

Worked example

For f(x)=x³-6x²+11x-6 and a=2, Horner values are 1, -4, 3, 0. Thus the remainder is 0 and the quotient is x²-4x+3.

Limits and edge cases

Maximum degree 50, coefficient magnitude at most 1e12 and |a| at most 1e6. Leading zeros are rejected except for the zero constant polynomial. The factor verdict uses exact equality of the computed floating-point remainder; very small nonzero remainders are not silently called zero. Decimal calculations use floating-point arithmetic; displayed values are rounded to 12 significant digits. This is an educational tool, not a guarantee about investments or physical systems.

FAQ

How do I enter missing terms?

Use zero coefficients, for example x³+1 is 1,0,0,1.

Does a tiny remainder prove a factor?

No. Decimal arithmetic may round; inspect the remainder or use exact algebra for proof.

Formula reference

Background mathematics. Explanation and examples on this page are independently written.