Aller au contenu
Ludicademy
English
Thème Élan
ClairsSombres
S’inscrire
3e · Arithmétique

The greatest common divisor

Never slip up again on: The greatest common divisor.

≈ 6 min read · level 3e · three questions at the end

Version française English version

In brief
  • 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 StepThe RuleOn 84 and 60The Point
Euclid's cascadeDivide, then divisor by remainder, repeat84=60×1+24, 60=24×2+12, 24=12×2+0Never fails, any size
The GCDThe last NON-ZERO remainder12Where the cascade lands
Reducing a fractionDivide top and bottom by the GCD84/60 = 7/5The direct flight to irreducible
CoprimeGCD = 1, no shared factor but 17 and 5The fraction is already lowest
Perfect sharingThe GCD splits into equal lots12 baskets: 7 apples, 5 pearsNothing left over
The cousin LCMLeast common multiple — synchronisingNot sharing: the two are oppositesNever confuse them
Exercice

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

The algorithm fault: stopping the cascade EARLY — reading the first remainder (24) as the GCD, or reading the zero itself: Euclid runs until the remainder is ZERO, and the GCD is the LAST NON-ZERO before it — one step too few gives a divisor that isn't greatest, one too many gives zero. The reduction fault: dividing by a COMMON factor that isn't the GREATEST — 84/60 by 2 gives 42/30, still reducible: only the GCD lands lowest in one move; a partial divisor leaves work undone, and "irreducible" must be checked (are top and bottom coprime?). The cousin confusion, the chapter's signature: GCD for LCM — using the greatest DIVISOR to synchronise cycles, or the least MULTIPLE to share objects: the GCD SHARES (largest equal lots, it's SMALL — at most the smaller number), the LCM SYNCHRONISES (first coincidence, it's BIG — at least the larger); their sizes alone betray a swap. And the coprime blind spot: not recognising GCD = 1 as "already irreducible" — hunting for a reduction that isn't there. Run to zero, divide by the GCD, and know which cousin the question wants: share or synchronise.
Exercice

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

OscarProvisions file: the GCD. Skelet, 84 apples and 60 pears — the caretaker wants the MOST identical baskets, none left over.
SkeletThe GCD shares perfectly: Euclid's cascade — 84=60×1+24, 60=24×2+12, 24=12×2+0 — the last non-zero remainder, 12. Twelve baskets, each 7 apples and 5 pears, nothing over. The largest equal grouping, found by running the cascade to zero and reading the step before: the machine never fails, and it just sorted the harvest.
OscarThe apprentice stopped at « 24, the first remainder ».
SkeletThe unfinished cascade: Euclid runs until the remainder is ZERO, and the GCD is the last non-zero BEFORE it — his 24 is one step too early, a divisor but not the greatest. His 24 baskets wouldn't divide the pears evenly: run to zero, read the step before, or the share limps. Patience is the algorithm's price, and it is cheap.
OscarThe cascade is run to its end. The clerk then reduces the yield ratio 84/60, dividing « by 2, then he'll see ».
SkeletThe scenic route: dividing by 2 gives 42/30, still reducible — he'll circle for three more divisions. The GCD is the direct flight: divide top and bottom by 12 at once, 7/5, irreducible, landed. And 7 and 5 are coprime — GCD 1 — the signal the descent is over: no more common factor to find. One division, not four.
OscarThe direct flight is booked. Last confusion: he uses the GCD to time the two mill wheels turning every 12 and 18 minutes.
SkeletThe cousin confusion, the chapter's signature: the GCD SHARES, the LCM SYNCHRONISES — opposite questions. Wheels coinciding is the LCM: 36 minutes, the first shared multiple. His GCD of 6 would be far too small — synchronising needs a BIG number (at least the larger cycle), sharing a small one (at most the smaller count). Their sizes alone unmask the swap.
OscarThe cousins are sorted by size. Cascades run, flights booked, cousins distinguished: stamp — apposed once per basket, 12 identical seals, the GCD of the file.
SkeletThe greatest common stamp: twelve equal lots, nothing over — sharing made ink. The harvest closes at 12 baskets and a 7/5 yield — cascade to zero, direct flight to irreducible, and the LCM left to time the mill.

Remember
  • 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.

Key expressions

Expression Meaning
the last non-zero remainderEuclid's cascade
84/60 = 7/5the direct flight to irreducible
coprimeGCD equal to 1
12 lots of 7 and 5the perfect share
the cousin LCMsynchronising is not sharing

Maintenant, jouez-la

Trois questions pour voir

La règle est lue. Voyons si elle est entrée : trois questions, ici même, sans compte.

35 exercices corrigés de maths en 3e → sans compte, corrigés à chaque réponse

La règle est lue ; il reste à la faire entrer. Trois minutes suffisent.

Jouer « le pont de cordes » → Quiz Express · sans compte

Ou choisissez votre salle :

Et côté jeux de société : 🎪 Jeu de calcul mental → les règles de jeu de calcul mental

Toutes les leçons 3e