Function polynomial_gcd 

pub fn polynomial_gcd(
    p1: &Expression,
    p2: &Expression,
) -> Result<Expression, PolynomialError>

Polynomial GCD - routes to best algorithm automatically

Uses fast-path optimization to avoid expensive classification for simple cases.

Arguments

• p1 - First expression
• p2 - Second expression

Returns

GCD of the two expressions

Examples

use mathhook_core::algebra::gcd::polynomial_gcd;
use mathhook_core::core::Expression;

let a = Expression::integer(12);
let b = Expression::integer(18);
let gcd = polynomial_gcd(&a, &b).unwrap();
assert_eq!(gcd, Expression::integer(6));