Exact Polynomial GCD and Square-free Review

How to use Exact Polynomial GCD and Square-free Review

Use exact rational coefficients in ascending degree order. Euclidean remainder reduction yields a monic GCD; square-free mode computes f/gcd(f,f′). Divisibility is verified against the original inputs before the result is returned.

1. Enter model json (schema and units below).
2. Choose the stated convention and check the units and supported model.
3. Calculate, inspect the result, then copy or download it.

Good to know

• Plain decimal JSON numbers or strings, at most six fractional places, magnitude at most 1,000,000,000; raw numeric spellings and duplicate object members are checked. Exact rational arithmetic is capped at 8,192 bits. Text is at most 30,000 characters; a local JSON download preserves exact fractions or full stored approximate numbers. Degree at most 12, at most 30 reduction steps and bounded rational growth. Square-free mode requires second:[]. Zero/zero and the zero polynomial square-free result are refused. No symbolic expression parsing, root approximation, multivariate algebra or factorization into irreducibles.
• Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.