Least common multiple

A common multiple m of a and b that divides every other common multiple (defined up to associates).
Least common multiple

Let RR be an and let a,bRa,b\in R. A least common multiple of aa and bb is an element mRm\in R such that:

  1. ama\mid m and bmb\mid m, and
  2. if ana\mid n and bnb\mid n, then mnm\mid n.

An lcm is unique up to . In settings where exist, one often has the relation mdm\cdot d is associate to abab, where dd is a gcd of aa and bb.

Examples:

  • In Z\mathbb{Z}, lcm(12,18)=36\mathrm{lcm}(12,18)=36.
  • In k[x]k[x], lcm(x,x2)=x2\mathrm{lcm}(x,x^2)=x^2 (up to multiplication by a nonzero scalar).
  • For any aRa\in R, a least common multiple of aa and 00 is 00.