Safe CAS engine
Bounded symbolic algebra engine with a safe AST, exact arithmetic and explicit messages for unsupported cases.
Bounded symbolic algebra engine with a safe AST, exact arithmetic and explicit messages for unsupported cases.
Report an error, translation issue, or idea. The form will not change this page's inputs or result.
A shared, bounded symbolic algebra engine. It simplifies, substitutes, expands and factors polynomials and solves equations up to degree 4 without executing code.
The engine uses a controlled grammar and safe AST and never executes code. Its symbolic scope is degree 0–4 polynomials with exact rational arithmetic; factorization covers rational linear factors. Cubic and quartic equations have exact results when rational-root reduction and a quadratic complete the solution; remaining results are explicit complex approximations. Elementary functions are evaluated numerically only. Unsupported transcendental equations and parameter dependencies return a localized message. No arbitrary code execution or domain-changing assumptions are used.
Internal bounded polynomial algorithms · mathjs parser AST