Rolle's Theorem Point Finder Calculator

It then identifies the leftmost qualifying point as the primary answer while retaining any additional valid points. This makes the result useful for homework checks, worked examples, and automated calculus exercises without hiding whether the theorem's essential endpoint condition was actually satisfied.

What Rolle's theorem guarantees

Rolle's theorem applies when a function is continuous on a closed interval, differentiable throughout the corresponding open interval, and has equal values at the two endpoints. Every polynomial automatically meets the continuity and differentiability requirements, so the decisive input check is whether f(a) equals f(b). When it does, the theorem guarantees at least one number c strictly between a and b for which f'(c) equals zero. Geometrically, the graph has a horizontal tangent somewhere between two endpoint locations at the same height. This calculator evaluates both endpoint values before solving the derivative, rather than assuming that the theorem applies merely because an interval was supplied. If the values differ beyond a small scale-aware numerical tolerance, it returns an input error instead of presenting a critical point as a Rolle point. The distinction matters: a polynomial may have derivative zeros even when its endpoint values differ, but those points are not guaranteed by Rolle's theorem on the interval you entered. The returned endpoint value therefore documents the condition that supported the conclusion.

How to enter and interpret the polynomial

Enter a polynomial using x as the variable, decimal coefficients, and a caret for powers, for example x^3 - 3x or 2x^4 - 8x^2 + 6. Multiplication signs are optional, so 4*x and 4x mean the same thing. Exponents must be non-negative integers, and the bounded parser accepts degrees through twelve. Then enter interval_start and interval_end with the left endpoint smaller than the right endpoint. The result's point field is the leftmost qualifying value of c, which supplies one unambiguous answer when an exercise asks for “the point.” The points array contains every distinct derivative-zero value isolated inside the interval, because Rolle's theorem promises existence but does not promise uniqueness. Each entry also reports the derivative evaluated at the rounded point. A tiny displayed residual can occur when an irrational root is rounded to the requested precision; it does not mean the root failed the equation. The derivative_coefficients array lists coefficients in descending powers, allowing you to verify the differentiation independently or reconstruct the derivative polynomial for a written solution.

How the calculation finds reliable interior points

The algorithm first combines like powers and evaluates the polynomial with Horner's method. It constructs the derivative exactly from the entered coefficients, then isolates its real roots recursively. The roots of each derivative divide the interval into sections where the polynomial being solved is monotonic. Sign changes in those sections are refined by bounded bisection, while derivative boundary points are checked separately so repeated roots are not missed simply because their graphs touch zero without crossing it. Only roots strictly inside the open interval are retained; an endpoint where the derivative happens to be zero does not satisfy Rolle's conclusion for c. All loops have fixed bounds, the degree and input length are capped, and the calculation uses no network, randomness, or clock. Precision controls output rounding, not whether the theorem's endpoint condition is silently relaxed. For classroom work, use the returned point as a numerical result and show the symbolic steps: compute f(a) and f(b), state that polynomials are continuous and differentiable, differentiate f, and solve f'(c)=0 with a<c<b. That presentation connects the calculator result to the theorem's hypotheses and conclusion.