According to Wikipedia ("Least common multiple", 27-Aug-2020,
https://en.wikipedia.org/wiki/Least_common_multiple): "In arithmetic and
number theory, the *least common multiple*, lowest common multiple, or
smallest common multiple of two integers a and b, usually denoted by
lcm(a, b), is the smallest positive integer that is divisible by both a
and b. Since division of integers by zero is undefined, this definition has
meaning only if a and b are both different from zero. However, some authors
define lcm(a,0) as 0 for all a, which is the result of taking the lcm to be
the least upper bound in the lattice of divisibility. ... The lcm of more
than two integers is also well-defined: it is the smallest positive integer
hat is divisible by each of them."

In this section, an operation calculating the least common multiple of two integers (df-lcm) as well as a function mapping a set of integers to their least common multiple (df-lcmf) are provided. Both definitions are valid for all integers, including negative integers and 0, obeying the above mentioned convention. It is shown by lcmfpr that the two definitions are compatible.

- clcm
- clcmf
- df-lcm
- df-lcmf
- lcmval
- lcmcom
- lcm0val
- lcmn0val
- lcmcllem
- lcmn0cl
- dvdslcm
- lcmledvds
- lcmeq0
- lcmcl
- gcddvdslcm
- lcmneg
- neglcm
- lcmabs
- lcmgcdlem
- lcmgcd
- lcmdvds
- lcmid
- lcm1
- lcmgcdnn
- lcmgcdeq
- lcmdvdsb
- lcmass
- 3lcm2e6woprm
- 6lcm4e12
- absproddvds
- absprodnn
- fissn0dvds
- fissn0dvdsn0
- lcmfval
- lcmf0val
- lcmfn0val
- lcmfnnval
- lcmfcllem
- lcmfn0cl
- lcmfpr
- lcmfcl
- lcmfnncl
- lcmfeq0b
- dvdslcmf
- lcmfledvds
- lcmf
- lcmf0
- lcmfsn
- lcmftp
- lcmfunsnlem1
- lcmfunsnlem2lem1
- lcmfunsnlem2lem2
- lcmfunsnlem2
- lcmfunsnlem
- lcmfdvds
- lcmfdvdsb
- lcmfunsn
- lcmfun
- lcmfass
- lcmf2a3a4e12
- lcmflefac