Find the earliest positive multiple shared by two nonzero integers. Formula and least common multiple remain visible in one place for independent verification.
The least common multiple is the smallest positive number divisible by each starting integer. In prime-factor language it keeps every required prime, using the largest exponent found in either number.
Zero has no positive least multiple under the usual calculator convention, so this tool asks for nonzero integers. Negative signs do not change the positive LCM. If the Least Common Multiple assumptions do not fit, consider factorization method.
Either compare prime factorizations or first find the GCF. Multiplying and then dividing by the GCF removes the shared factor counted twice in the raw product.
Repeated schedules meet at an LCM. A task repeating every 18 days and another repeating every 24 days coincide every 72 days, assuming they start together.
Because gcd(18, 24) = 6, the product relationship gives lcm(18, 24) = |18 × 24| ÷ 6 = 72. Listing multiples reaches the same answer but takes longer for large values. This Least Common Multiple example can be compared with common factors.
Keep First integer integral when Least Common Multiple requires integers. Verify Second integer through the defining Least Common Multiple identity.
Test zero in Least Common Multiple, then test one in Least Common Multiple. Rebuild the starting integer through Least Common Multiple.
Before accepting Least common multiple, restore the Least Common Multiple inputs First integer and Second integer. Estimate Least common multiple independently. Then vary Second integer alone and observe the new Least Common Multiple output. This isolates the changed part of Least Common Multiple.
Vary First integer alone to test Least Common Multiple sensitivity. Freeze Second integer and watch Least common multiple. Several simultaneous edits would hide which part of the Least Common Multiple setup caused the change in Least common multiple.
The product contains the shared prime factors twice; the LCM needs their highest powers only once.
Yes. If one integer divides the other, the larger absolute value is already a common multiple.
No. Swapping the two integers leaves the LCM unchanged.