How to calculate
For the GCF, apply the Euclidean algorithm across the list. For the LCM, combine each pair by dividing its absolute product by its GCF.
Worked example
Use Integers 12, 18, 30. The result is GCF 6 · LCM 180.
Input and result notes
Enter 2 to 20 integers. If any entry is zero and at least one is nonzero, the LCM is zero.