| BoundsA multiple of both numbers is at least the larger one, and the product is always a common multiple, as what LCM is explains. | max(a,b)≤lcm(a,b)≤a⋅b | the range the LCM always falls in |
| Same number and oneIn both cases a already qualifies as the smallest common multiple, from the basic properties. | lcm(a,a)=a,lcm(a,1)=a | the LCM when nothing new has to be covered |
| OrderThe common multiples of a and b are those of b and a, one of the basic properties. | lcm(a,b)=lcm(b,a) | the same answer in either order |
| Common multiplesBoth numbers divide the LCM by definition, and the LCM divides every other common multiple (basic properties). | a∣lcm(a,b) and b∣lcm(a,b) | every other common multiple is a multiple of the LCM |
| Using the GCDOften the fastest route; using the GCD divides before multiplying, gcd(a,b)a⋅b, to keep the numbers small. | lcm(a,b)=gcd(a,b)a⋅b | the LCM in a single division once the GCD is known |
| GCD–LCM relationshipFor each prime the GCD keeps the smaller exponent and the LCM the larger, as the GCD–LCM relationship proves. | a⋅b=gcd(a,b)⋅lcm(a,b) | either quantity from the other |
| Coprime numbersIt also works the other way: an LCM equal to the product means the numbers are coprime, as the coprime case shows. | lcm(a,b)=a⋅b when gcd(a,b)=1 | the full product, since no prime is shared |
| One divides the otherThe smallest possible LCM, from when one divides the other. | if a∣b, then lcm(a,b)=b | the larger number itself |
| More than two numbersThe order of pairing does not matter; see LCM of more than two numbers. | lcm(a,b,c)=lcm(lcm(a,b),c) | the LCM of any list, pair by pair |