Foundations Unit F2
Factors, Multiples & Primes
Divisibility shortcuts, prime factor trees, and GCF vs LCM.
What factors and multiples really are, the divisibility shortcuts and why they work, prime factorization, and finding GCF and LCM without mixing them up.
Builds on: F1 · Operations & Integers
Two questions you already ask
Hot dogs come in packs of , buns in packs of . How many of each pack do you buy so that nothing is left over? Different day, different problem: you have cookies and candies to split into identical gift bags with none left behind — what’s the biggest number of bags you can make? Both questions are about seeing inside whole numbers: when they split evenly, and when two counting patterns line up. In F1 you took an expression apart operation by operation; this unit takes a single number apart into its multiplicative building blocks.
One fact, seen two ways
Everything grows out of a single multiplication fact. Take . Read from one end: and are factors of — they divide it evenly, no remainder. Read from the other: is a multiple of both and — it’s a stop on their skip-counting lists. Same fact, two directions of view. Factor questions look down into a number; multiple questions look up and outward from it. Keeping that compass straight is half of this unit.
A factor pair has a shape you can see: it’s a way to arrange that many dots into a full rectangle — no gaps, no leftovers.
Before you look too closely, predict: how many rectangles can make? (Count , , .) Now type — nothing but the single line exists. Then : it has a rectangle none of the others had, the perfect square — which is why has an odd number of factors while almost every number has an even count (factors come in pairs, unless one pairs with itself).
Multiples are the opposite direction: start at the number and keep adding it, forever.
Light up and watch the stripes. Then try , remember the pattern, and switch to : the squares lit both times — , , — are the common multiples of and , and the first one, , will matter in a minute.
Primes: the atoms of multiplication
Some numbers refuse to make any rectangle except the single line. Their only factors are and themselves: These are the primes, and they play the role atoms play in chemistry — every whole number from up is built by multiplying primes, and (this is the remarkable part) in exactly one way. is no matter how you find the pieces. A number with more than one rectangle is composite: it can be broken down further.
Two edge cases earn their reputation. is the only even prime — every other even number already contains as an extra factor. And is neither prime nor composite: if we called a prime, the “exactly one way” promise would collapse, since Mathematicians shut that door by definition.
To find a number’s atoms, split it any way you can and keep splitting until only primes remain — a factor tree:
Try and check it matches the steps above. Then predict ‘s leaves before typing it — how many s? Then try : the tree refuses to branch at all.
Divisibility shortcuts — and why they work
Factor trees need a way to spot factors quickly, and that’s what these shortcuts are for — a factor at a glance, no long division.
| ÷ by | Shortcut | Why it works |
|---|---|---|
| last digit is even | tens, hundreds… are all even, so only the last digit decides | |
| ends in or | every group of ten is a multiple of | |
| digit sum divisible by | are each one more than a multiple of | |
| digit sum divisible by | same reason as | |
| last two digits divisible by | is divisible by , so hundreds never matter | |
| passes both and | , so it must clear both |
The digit-sum rule deserves a second look, because it feels like magic. Every is a plus , every is a plus — so , which regroups into (a pile of nines) . The pile of nines is certainly divisible by , so only the digit sum decides. That’s not a coincidence to memorize; it’s the base-ten system showing its seams.
Before checking : is it even? Does go in? Does ? Make all three calls, then look. Then try — it feels prime, but the digit sum gives it away.
GCF & LCM — two questions, two directions
Now the opening problems. The gift bags ask: what’s the biggest number that divides both and ? — the Greatest Common Factor. The hot dogs ask: what’s the first number both and count up to? — the Least Common Multiple (: four packs of hot dogs, five of buns).
Why do people swap them? Because both are “a number the two numbers share,” and the names are a mouthful — so the mind grabs whichever word surfaces first. The rescue is the direction compass: a common factor fits inside both numbers, so the GCF can never exceed the smaller one. A common multiple contains both numbers, so the LCM can never be below the larger one. If your “GCF of and ” comes out as , the size alone says you answered the other question.
The prime-atom picture makes both mechanical: the GCF is the atoms the two numbers share (lowest power of each shared prime), and the LCM is the smallest collection containing each number’s full set (highest power of every prime that appears).
Set and and predict both answers first (, — shared atoms ). Then try and : no shared primes at all, so the GCF drops to and the LCM has no choice but to be the full product, .
The one thing to remember
Whole numbers have insides, and primes are the atoms: every number is one unique multiplication of primes. Factor questions look down into a number (GCF = the shared atoms); multiple questions look up from it (LCM = the smallest pile of atoms containing both). When you’re unsure which one a problem wants, check the direction: splitting evenly looks down, lining up looks up.
The vocabulary
- Factor — divides evenly. Factors of : .
- Multiple — what you get by multiplying. Multiples of :
- Prime — exactly two factors, and itself: ( is the only even prime; is not prime.)
Divisibility shortcuts (memorize these)
| ÷ by | Trick | Example |
|---|---|---|
| ends in an even digit | ||
| digit sum divisible by | ||
| last two digits ÷ | ||
| ends in or | ||
| passes and | ||
| last three digits ÷ | ||
| digit sum divisible by | ||
| ends in | ||
| alternating digit sum ÷ |
GCF vs LCM
For and :