The Lcm function is a placeholder for representing the least common multiple of an arbitrary number of polynomials with rational coefficients. Lcm is used in conjunction with mod or modp1 as described below which define the coefficient domain.

The call Lcm(a, b, ...) mod p computes the least common multiple of the polynomials modulo p a prime integer. The inputs must be polynomials over the rationals or over a finite field specified by RootOf expressions.

The call modp1(Lcm(a, b, ...), p) does likewise for polynomials in the modp1 representation.

$\mathrm{Lcm}\left(x^2+1\,x^2+x\right)\mathbf{mod}2$

$x^3+x$