What's the biggest number that divides both 20 and 36 without a remainder?
If you’ve ever stared at a worksheet and wondered why the answer isn’t just “4,” you’re not alone. The highest common factor (HCF) – also called the greatest common divisor (GCD) – sounds fancy, but it’s really just the largest whole number that fits evenly into two (or more) numbers. In the case of 20 and 36, that number is 4.
Short version: it depends. Long version — keep reading.
Below we’ll unpack what “highest common factor” really means, why it matters beyond the classroom, and the step‑by‑step ways you can find it without pulling out a calculator. We’ll also flag the traps most people fall into and hand you a handful of tricks you can use tomorrow, whether you’re solving a math problem, simplifying a fraction, or planning a DIY project.
What Is the Highest Common Factor
When you hear “highest common factor of 20 and 36,” think of it as the biggest piece of a puzzle that can be used to build both numbers. In plain English: it’s the greatest integer that divides both 20 and 36 cleanly That alone is useful..
Prime factor method
One way to see it is to break each number down into its prime ingredients.
- 20 = 2 × 2 × 5
- 36 = 2 × 2 × 3 × 3
The primes they share are two 2’s. Multiply those together and you get 2 × 2 = 4. That’s the HCF.
Euclidean algorithm
Another, more algorithmic route is the Euclidean method. Start with the larger number (36) and repeatedly subtract the smaller one (20) or, more efficiently, use the remainder:
- 36 ÷ 20 = 1 remainder 16
- 20 ÷ 16 = 1 remainder 4
- 16 ÷ 4 = 4 remainder 0
When the remainder hits zero, the divisor at that step (4) is the HCF Simple, but easy to overlook..
Both techniques land on the same answer, but the Euclidean algorithm scales nicely when you’re dealing with huge numbers It's one of those things that adds up..
Why It Matters / Why People Care
You might wonder, “Why bother with the HCF of 20 and 36? Even so, it’s just a school exercise. ” The truth is, the concept pops up everywhere.
- Simplifying fractions – If you have 20/36, dividing numerator and denominator by the HCF (4) gives you 5/9, the simplest form.
- Design and construction – Say you need a tile pattern that repeats every 20 cm horizontally and 36 cm vertically. The HCF tells you the largest square tile that will fit perfectly in both directions – 4 cm.
- Music and rhythm – In a 20‑beat and a 36‑beat loop, the HCF (4) reveals the smallest number of beats after which both loops line up again.
- Computer science – Algorithms that need to find common intervals or synchronize processes often rely on the GCD.
Missing the HCF can lead to wasted material, longer calculations, or even design flaws. Knowing it gives you a shortcut and a deeper sense of how numbers relate It's one of those things that adds up. Turns out it matters..
How It Works (or How to Do It)
Below is the toolbox you can reach for, depending on the situation. Pick the method that feels most natural, then practice a couple of times and you’ll never need a cheat sheet again.
1. List the factors
Write out every factor of each number, then spot the biggest match.
- Factors of 20: 1, 2, 4, 5, 10, 20
- Factors of 36: 1, 2, 3, 4, 6, 9, 12, 18, 36
The common ones are 1, 2, 4. The highest is 4.
When to use: Small numbers, quick mental check.
2. Prime factorisation
Break each number into primes, then multiply the shared primes.
- Write the prime list:
- 20 = 2² × 5
- 36 = 2² × 3²
- Identify the overlap: two 2’s.
- Multiply them: 2 × 2 = 4.
When to use: You already have the prime factors handy, or you’re comfortable with factor trees.
3. Euclidean algorithm (the “division” trick)
This is the fastest for big numbers.
- Divide the larger by the smaller, keep the remainder.
- Replace the larger number with the smaller, the smaller with the remainder.
- Repeat until remainder is zero. The last non‑zero divisor is the HCF.
Applying it to 20 and 36:
- 36 ÷ 20 = 1 r 16
- 20 ÷ 16 = 1 r 4
- 16 ÷ 4 = 4 r 0 → HCF = 4
When to use: Numbers in the hundreds or thousands, or when you need a reliable, repeatable process.
4. Using a calculator or spreadsheet
If you’re already at a computer, most scientific calculators and spreadsheet programs have an GCD function. In Excel, type =GCD(20,36) and hit Enter.
When to use: You’re already working in a digital environment and want to double‑check your manual work.
Common Mistakes / What Most People Get Wrong
- Confusing HCF with LCM – The least common multiple (LCM) is the smallest number that both originals fit into, not the biggest they fit out of. For 20 and 36, the LCM is 180, not 4.
- Skipping the zero remainder rule – In the Euclidean algorithm, stopping at a non‑zero remainder gives a common divisor, but not necessarily the highest one.
- Leaving out a prime factor – When factorising, it’s easy to forget a repeated prime. Forgetting one of the 2’s in 20 would mistakenly give an HCF of 2.
- Assuming the smaller number is always the HCF – 20 is smaller than 36, but the HCF is 4, not 20.
- Mixing up “common factor” with “common multiple” in real‑world problems – In the tile example, using the LCM instead of the HCF would give a massive tile size that never fits.
Spotting these pitfalls early saves you a lot of head‑scratching later.
Practical Tips / What Actually Works
- Start with the Euclidean algorithm for any pair of numbers – it’s quick, works for huge values, and you only need division and subtraction.
- Keep a prime‑factor cheat sheet – memorize the first few primes (2, 3, 5, 7, 11…) and practice factor trees. It pays off when you’re doing mental math.
- Use the “common factor list” only for numbers under 50 – beyond that the list gets unwieldy.
- When simplifying fractions, always divide by the HCF – it guarantees the fraction is in lowest terms.
- In DIY projects, treat the HCF as your “grid size” – it tells you the largest repeatable unit that will line up perfectly on both dimensions.
And a little secret: if you ever get stuck, just ask yourself, “What’s the biggest number that can go into both without leaving a remainder?Day to day, ” Write down a few candidates (1, 2, 4, 5…) and test them quickly. The answer will jump out.
FAQ
Q1: Can the HCF ever be larger than the smaller of the two numbers?
A: No. By definition the HCF cannot exceed the smallest number, because a larger number couldn’t divide the smaller one evenly.
Q2: Is the HCF always a prime number?
A: Not necessarily. For 20 and 36 the HCF is 4, which is composite. The HCF is simply the greatest common divisor, prime or not.
Q3: How do I find the HCF of more than two numbers, say 20, 36, and 48?
A: Find the HCF of any two (e.g., 20 and 36 → 4), then find the HCF of that result with the third number (4 and 48 → 4). The final answer is the HCF of all three.
Q4: Does the Euclidean algorithm work with negative numbers?
A: Yes, but you usually take the absolute values first. The HCF is always a non‑negative integer.
Q5: Why do some textbooks call it “greatest common divisor” instead of “highest common factor”?
A: It’s a regional naming difference. “Greatest common divisor” (GCD) is more common in the U.S., while “highest common factor” (HCF) is used in the U.K. and parts of Asia. Both mean the same thing.
That’s it. Whether you’re juggling fractions, laying down a floor, or just trying to ace a quiz, the highest common factor of 20 and 36 is a small number with big utility. Keep the methods above in your back pocket, watch out for the usual slip‑ups, and you’ll find the HCF of any pair of numbers in no time. Happy calculating!
This is the bit that actually matters in practice Practical, not theoretical..
