Documentation moved.
This entry is now part of the unified function reference. Open the unified page →
Function
src/algebra/gcd/gcd.ts:29gcd
gcd(x: ExpressionInput, y: ExpressionInput): ExpressionComputes a symbolic greatest common divisor over rational polynomial structure.
remarks
Numerators and denominators are polynomialized, function-valued or irrational constants may be temporarily substituted, and the multivariate Zippel GCD is verified by exact polynomial division. Factoring supplies a deliberately expensive final fallback. When conversion or the supported polynomial algorithms fail, the result remains symbolic as
`gcd(x, y)`.
Parameters
| Name | Type | Description |
|---|---|---|
x | ExpressionInput | First expression-compatible operand. |
y | ExpressionInput | Second expression-compatible operand. |
Returns
Expression — The exact symbolic GCD or an unevaluated `gcd` expression.
