Use GCD and LCM to Synchronize Repeating Schedules

Express every period in the same unit

Suppose one task repeats every 12 minutes and another every 18 minutes. Use minutes for both values; entering 12 minutes and 0.3 hours as unrelated raw numbers changes the problem. Choose the smallest common time unit that expresses the periods as integers.

Find the shared factor first

Euclid’s algorithm gives gcd(18,12) = gcd(12,6) = 6. The factor is the largest equal-sized block that divides both periods with no remainder. It is not the next time both tasks restart: six minutes divides the periods but is shorter than either cycle.

Compute the next common restart

LCM(12,18) = |12 × 18|/GCD(12,18) = 216/6 = 36 minutes. The first task has completed three cycles and the second two cycles at that time. Prime factorization checks the result: 12 = 2² × 3 and 18 = 2 × 3², so the maximum prime powers give 2² × 3² = 36.

Add another period iteratively

If a third task repeats every 20 minutes, calculate LCM(36,20). Their GCD is four, giving 36 × 20/4 = 180 minutes. Confirm 180/12 = 15, 180/18 = 10 and 180/20 = 9, all whole numbers. Pairwise iteration avoids assuming that the first two tasks’ alignment also suits the third.

Check whether the starts are aligned

The LCM shortcut assumes the tasks share their initial start. If one begins five minutes later, matching the periods alone is insufficient; offsets create a different modular arithmetic problem. Similarly, a zero period is not an active repeating schedule, even though the calculator defines useful algebraic zero conventions for GCD and LCM.

Verify a new alignment by enumerating small multiples

For periods of eight and fourteen minutes beginning together, GCD is two and LCM is 8 × 14/2 = 56 minutes. Small multiples provide an independent check: eight-minute restarts occur at 8, 16, 24, 32, 40, 48 and 56; fourteen-minute restarts at 14, 28, 42 and 56. The first positive shared value is fifty-six, not their common divisor of two and not their product of 112.

If both begin at 09:00, the next common restart is 09:56. Later common restarts occur another fifty-six minutes apart. Adding a twenty-one-minute task gives LCM(56,21) = 168 minutes, because their GCD is seven. Divide 168 by each original period: the counts are 21, 12 and 8, all integers. Three tasks therefore align at 11:48 after a shared 09:00 beginning.

Convert fractional periods to integers in one shared unit

Periods of 1.5 and 2.25 minutes become ninety and 135 seconds. Their GCD is forty-five seconds and their LCM is 270 seconds, or 4.5 minutes. The ninety-second task has completed three cycles and the 135-second task two. Using the original fractional numerals in a whole-integer GCD field would be rejected; converting both into seconds preserves the intended periods without rounding either one.

Choose the unit based on the supplied precision rather than simply multiplying every decimal by an arbitrary power of ten. For periods specified to milliseconds, seconds might still leave fractional inputs. Conversely, a measurement described only as approximately one and a half minutes should not acquire artificial precision from a conversion to ninety thousand milliseconds. Integer-cycle arithmetic assumes exact periods; variable execution times require another scheduling model.

Check phase compatibility before relying on an LCM

Now start the eight-minute task at elapsed time zero but the fourteen-minute task two minutes later. Their restarts satisfy t divisible by eight and t − 2 divisible by fourteen. At t = 16, the first has completed two periods and the second one, so their first nonnegative common restart is sixteen minutes. LCM still describes the fifty-six-minute repeat spacing once alignment is found, but it did not identify this first offset meeting.

If the offset were one minute instead, alignment would require an even multiple of eight to differ by one from an even multiple of fourteen. That is impossible in this integer-minute model. More generally, the offset difference must be divisible by the periods’ GCD for a shared solution to exist. The GCD/LCM tool does not solve arbitrary phase offsets; these small examples show why a separately stated modular calculation is needed.

Separate exact elapsed cycles from calendar recurrences

Write down the initial common instant and the physical unit next to every period. A rule to run at 09:00 each local day is not necessarily an exact 1,440-minute cycle through a daylight-saving transition. A named-zone calendar schedule and an elapsed-duration timer can deliberately produce different instants. Convert actual instants with a date-aware zone tool rather than labeling a raw LCM as a universally valid calendar meeting time.

For a numerical audit, verify that the LCM divided by every positive period is an integer and that no smaller positive candidate works in a small example. Negative numerical inputs use absolute magnitudes in the tool, but an operational interval should be positive. A zero period makes no repeating-task sense even where algebraic GCD/LCM conventions define an output. Holidays, skipped runs and task delays also change the real schedule beyond this fixed-period model.