Greatest common divisor. Coprime numbers
A number that divides both of two numbers exactly is a common divisor of them. The greatest of the common divisors is the greatest common divisor (GCD). To find it, factor the numbers into primes, take the prime factors that appear in both with their smallest powers and multiply. For example 24 = 2³ · 3 and 36 = 2² · 3², so the common part is 2² · 3 = 12. If the GCD of two numbers is 1, they are coprime; the numbers themselves need not be prime, for example 14 and 25.
GCD(12, 18) = 6, LCM = 36
Orange: common divisors; the biggest is the GCD
a · b = GCD · LCM: 216 = 216
For a neighbourhood celebration, identical gift sets are made from 18 notebooks and 30 pencils with nothing left over. GCD(18, 30) = 6, so there are 6 sets, each with 3 notebooks and 5 pencils.
Volunteers share gifts evenly, a craftsman picks the largest equal square tiles for a floor, and a teacher splits a class into as many equal groups as possible.
Take 12 buttons and 20 pebbles and find the greatest number of identical sets you can make with nothing left over.
“Biggest boxes”: groups get 36 red and 48 blue pencils (cards or counting sticks). They must split them into identical sets: what is the greatest number of sets? Groups check their answer with the GCD.