SANAA
UREMBO NA USTAWI
UJANJA
UTAMADUNI NA HISTORIA
BURUDANI
MAZINGIRA
CHAKULA NA VINYWAJI
BAADAYE YA KIJANI
REVERSE ENGINEERING
SCHOOL PROJECTS
SAYANSI
MICHEZO
TEKNOLOJIA
VAZI
Euclid's Algorithm — Find the Biggest Shared Measure with Paper Strips
Mark

Imeundwa na

Mark

2. Julai 2026FI
10
0
0
0
0

Euclid's Algorithm — Find the Biggest Shared Measure with Paper Strips

A hands-on maths project: cut two paper strips of different lengths and repeatedly lay the shorter along the longer to find their greatest common measure -- Euclid's 2,300-year-old algorithm, done with your hands. A Python cell checks your answer, and a compendium shows why this simple recipe still runs inside computers.
Mwanzo
30 minutes

Maagizo

1

The greatest common measure

The greatest common divisor of two numbers is the largest number that divides both. Around 300 BC Euclid found a beautiful way to get it without factoring. You will do it as he did -- as lengths.
2

Cut two strips

Cut two strips of card, one 48 cm and one 18 cm (or any two lengths). The greatest common divisor is the longest ruler-length that measures BOTH strips a whole number of times.

Vifaa kwa hatua hii:

Cardstock Assorted Pack (50 sheets)Cardstock Assorted Pack (50 sheets)1 kipande

Zana zinazohitajika:

Sharp ScissorsSharp Scissors
Steel Ruler (30cm)Steel Ruler (30cm)
3

Lay the short along the long

Lay the 18 cm strip along the 48 cm strip as many whole times as it fits (twice, reaching 36), and mark the leftover (12 cm). Now repeat with the two smaller lengths: fit 12 into 18 once, leftover 6. Fit 6 into 12 exactly twice, no leftover. The last non-zero leftover, 6 cm, is the answer -- it measures both original strips exactly.
4

Check it

Loading Jupyter Notebook...

Zana zinazohitajika:

Desktop ComputerDesktop Computer
CalculatorCalculator
5

Compendium: the oldest algorithm still running

What your strips reveal. (1) Each step replaces the longer length with the leftover, and it works because any length dividing both strips also divides the leftover. (2) It is astonishingly fast -- its very worst case is consecutive Fibonacci numbers, and even then it takes only a handful of steps for huge numbers. (3) The same idea reduces fractions to lowest terms (divide top and bottom by their GCD). (4) It is one of the oldest algorithms still in daily use, running billions of times a day inside the RSA encryption that protects online banking and messaging.

Vifaa

1

Zana Zinazohitajika

4

You can swap these in

Can't get one of the materials? Swap it for an equivalent — these work just as well.

CC0 Umma Wote

Mchoro huu umetolewa chini ya CC0. Uko huru kunakili, kubadilisha, kusambaza, na kutumia kazi hii kwa madhumuni yoyote, bila kuomba ruhusa.

Saidia Mtengenezaji kwa kununua bidhaa kupitia Mchoro wao ambapo wanapata Kamisheni ya Mtengenezaji iliyowekwa na Wachuuzi, au unda marudio mapya ya Mchoro huu na uiunganishe kama kiungo katika Mchoro wako kuchangia mapato.

Majadiliano

(0)

Ingia kujiunga na majadiliano

Inapakia maoni...