- Euclid's algorithm: divide, then divisor by remainder, repeat — the GCD is the LAST NON-ZERO remainder.
- Reducing a fraction: divide top and bottom by the GCD — the direct flight to irreducible (84/60 = 7/5).
- Coprime = GCD 1: the fraction is already lowest, top and bottom share nothing.
The Greatest Shared Divisor
The GCD of two whole numbers is the biggest number that DIVIDES BOTH — and this year computes it efficiently, then puts it to work. EUCLID'S ALGORITHM is the machine: divide the big by the small, then the divisor by the remainder, again and again — the LAST NON-ZERO REMAINDER is the GCD. For 84 and 60: 84 = 60×1 + 24, then 60 = 24×2 + 12, then 24 = 12×2 + 0 — the last non-zero remainder, 12, is the GCD, and the cascade never fails, however large the numbers. Its headline use: reducing a fraction to LOWEST TERMS in one move — 84/60 = 7/5 (divide top and bottom by the GCD 12): the direct flight to the irreducible, no laborious step-by-step simplifying. Two numbers with GCD = 1 are COPRIME (no shared factor but 1) — 7 and 5, for instance — the mark of an already-irreducible fraction. The GCD solves real sharing: "the most identical baskets from 84 apples and 60 pears" — 12 baskets, each with 7 apples and 5 pears, nothing left over. Its cousin the LCM (least common multiple) does the opposite job — SYNCHRONISING, not sharing — and the two must never be confused.
The Algorithm and Its Uses
| The Step | The Rule | On 84 and 60 | The Point |
|---|---|---|---|
| Euclid's cascade | Divide, then divisor by remainder, repeat | 84=60×1+24, 60=24×2+12, 24=12×2+0 | Never fails, any size |
| The GCD | The last NON-ZERO remainder | 12 | Where the cascade lands |
| Reducing a fraction | Divide top and bottom by the GCD | 84/60 = 7/5 | The direct flight to irreducible |
| Coprime | GCD = 1, no shared factor but 1 | 7 and 5 | The fraction is already lowest |
| Perfect sharing | The GCD splits into equal lots | 12 baskets: 7 apples, 5 pears | Nothing left over |
| The cousin LCM | Least common multiple — synchronising | Not sharing: the two are opposites | Never confuse them |
GCD of 84 and 60?
Euclid: 84=60×1+24, then 60=24×2+12, then 24=12×2+0 — the cascade stops at remainder 0, and the GCD is the one BEFORE: 12. The 24 stopped at the first remainder (the cascade wasn't finished); the machine runs until zero, and reads the last non-zero.
The Direct Flight, and the Perfect Share
Reducing in one move: 84/60 — the GCD is 12, so divide both by 12: 7/5, irreducible at once. The alternative — dividing by 2, then 2, then 3, watching for more — is the scenic route with detours; the GCD is the direct flight: one division top and bottom, and the fraction lands lowest. Coprime top and bottom (GCD 1) is the landing signal: 7 and 5 share nothing, the descent is over.The perfect share: 84 apples and 60 pears into the MOST identical baskets — the GCD, 12, is the number of baskets (any more, and the fruit won't divide evenly), each holding 84/12 = 7 apples and 60/12 = 5 pears, nothing left. The GCD answers "the largest equal grouping" ; its cousin the LCM answers "when do two cycles coincide" (buses every 12 and 18 minutes meet again at the LCM, 36) — sharing versus synchronising, opposite questions, never to be swapped.
The Unfinished Cascade — and the GCD/LCM Swap

Buses leave every 12 and 18 minutes together. When do they next coincide?
Synchronising cycles is the LCM's job, not the GCD's: the first shared multiple of 12 and 18 is 36. The 6 is the GCD (that shares objects, the wrong question); the 216 multiplied blindly (12×18 is A common multiple, not the LEAST). Share → GCD (small); synchronise → LCM (big).
Case File: The Harvest Baskets










- Euclid's algorithm: divide, then divisor by remainder, repeat — the GCD is the LAST NON-ZERO remainder.
- Reducing a fraction: divide top and bottom by the GCD — the direct flight to irreducible (84/60 = 7/5).
- Coprime = GCD 1: the fraction is already lowest, top and bottom share nothing.
- The GCD SHARES (largest equal lots, small) ; the LCM SYNCHRONISES (first coincidence, big) — never confuse them.
- Run the cascade to ZERO, read the step before — one step short isn't greatest.




