PolynomialLCM

PolynomialLCM[poly1,poly2,]

gives the least common multiple of the polynomials polyi.

PolynomialLCM[poly1,poly2,,Modulusp]

evaluates the LCM modulo the prime p.

Details and Options

  • PolynomialLCM[poly1,poly2,] will by default treat algebraic numbers that appear in the polyi as independent variables.
  • PolynomialLCM[poly1,poly2,,Extension->Automatic] extends the coefficient field to include algebraic numbers that appear in the polyi.

Examples

open allclose all

Basic Examples  (3)

Compute the least common multiple (LCM) of polynomials:

Compute the least common multiple of several polynomials:

Compute the least common multiple of multivariate polynomials:

Scope  (8)

Basic Uses  (4)

The LCM of univariate polynomials:

The LCM of multivariate polynomials:

The LCM of more than two polynomials:

The LCM of rational functions:

Advanced Uses  (4)

With Extension->Automatic, PolynomialLCM detects algebraically dependent coefficients:

Compute the LCM over the integers modulo :

With Trig->True, PolynomialLCM recognizes identities between trigonometric functions:

The LCM of rational functions:

Options  (3)

Extension  (1)

By default, algebraic numbers are treated as independent variables:

With Extension->Automatic, PolynomialLCM detects algebraically dependent coefficients:

Modulus  (1)

Compute the LCM over the integers modulo 2:

Trig  (1)

By default, PolynomialLCM treats trigonometric functions as independent variables:

With Trig->True, PolynomialLCM recognizes dependencies between trigonometric functions:

Applications  (2)

If divides , then their least common multiple is equal to :

If and are relatively prime, then their least common multiple is equal to :

In general, the least common multiple of and is divided by the greatest common divisor of and :

Use Together to prove the equality:

Compute the LCM of the first five cyclotomic polynomials. Notice the coefficients are anti-palindromic:

This results from the fact that every cyclotomic polynomial is palindromic except the first:

The first cyclotomic polynomial is anti-palindromic:

Thus when taking the product of palindromic polynomials with one anti-palindromic polynomial, we will always obtain an anti-palindromic polynomial:

Properties & Relations  (1)

The LCM of polynomials is divisible by the polynomials; use PolynomialMod to prove it:

PolynomialGCD finds the greatest common divisor of polynomials:

Wolfram Research (1991), PolynomialLCM, Wolfram Language function, https://reference.wolfram.com/language/ref/PolynomialLCM.html (updated 1996).

Text

Wolfram Research (1991), PolynomialLCM, Wolfram Language function, https://reference.wolfram.com/language/ref/PolynomialLCM.html (updated 1996).

BibTeX

@misc{reference.wolfram_2020_polynomiallcm, author="Wolfram Research", title="{PolynomialLCM}", year="1996", howpublished="\url{https://reference.wolfram.com/language/ref/PolynomialLCM.html}", note=[Accessed: 24-February-2021 ]}

BibLaTeX

@online{reference.wolfram_2020_polynomiallcm, organization={Wolfram Research}, title={PolynomialLCM}, year={1996}, url={https://reference.wolfram.com/language/ref/PolynomialLCM.html}, note=[Accessed: 24-February-2021 ]}

CMS

Wolfram Language. 1991. "PolynomialLCM." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 1996. https://reference.wolfram.com/language/ref/PolynomialLCM.html.

APA

Wolfram Language. (1991). PolynomialLCM. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/PolynomialLCM.html