Prime Factorisation: How Numbers Break Apart

See any whole number as a recipe made from prime building blocks, then use that recipe to factor quickly, write tidy exponent form, and compute GCD and LCM with less guesswork. Along the way, you will learn what to do with tricky cases like 1, 0, and negatives.

Prime factorisation feels like taking a number apart and finding the same few pieces inside every time. The surprising part is that you cannot truly disagree about the pieces. You can break the number in different ways, but if you keep going until you reach primes, you always land on the same prime recipe. Once you see numbers this way, tasks like simplifying fractions or finding the GCD stop feeling like separate tricks and start feeling like one idea used in different places.

Every number has a prime recipe

Prime factorisation means writing a whole number as a product of primes, like turning a cake back into flour, eggs, and sugar. You might start by splitting 60 into $6\times10$ or $3\times20$ or $12\times5$. Those look different, but they are just different groupings of the same basic ingredients.

What matters is whether you keep splitting until every factor is prime. At that point you have reached the number’s prime recipe, and rearranging the primes does not change the value.

Rule of thumb: If a factor is not prime, it can be broken again. Keep going until you cannot.

The only vocabulary you need

A few words keep factorisation from turning into a fog.

• Prime: A whole number greater than 1 with exactly two factors, 1 and itself.
• Composite: A whole number greater than 1 that is not prime. It has a nontrivial factor pair.
• Factor: A number that divides another exactly. 3 is a factor of 60 because $60\div3=20$.
• Multiple: A number you get by multiplying. 60 is a multiple of 3 because $3\times20=60$.
• Product: The result of multiplication, like $2\times2\times3\times5$.
• Exponent notation. Writing repeated primes compactly, like $2\times2\times2$ as $2^3$.

Notice the boundary lines. Prime and composite only apply to whole numbers greater than 1. Factor and multiple are a relationship between two numbers.

Two reliable methods to factor numbers

Prime factorisation is straightforward. You repeatedly replace a composite number with two smaller factors until only primes remain. Two methods do this cleanly.

Factor trees

A factor tree is a branching picture. You choose any factor pair to start, then keep splitting the composite pieces. It is friendly for beginners because you can see what still needs breaking.

Repeated division

Repeated division, sometimes called a division ladder, keeps dividing by small primes. If 84 is even, divide by 2. If the result is still even, divide by 2 again. Then try 3, then 5, and so on. It is often faster once you are comfortable.

If you want a quick decision rule, use a factor tree when you spot an easy pair like $84=7\times12$. Use repeated division when the number is clearly divisible by small primes and you want a tidy, linear path.

Speed tip: Always try 2, then 3, then 5. Most classroom numbers give up early.

Prime powers and tidy notation

The point of prime factorisation is not to leave a long multiplication sentence on the page. When the same prime repeats, collect it into a prime power. For example, $2\times2\times2\times3\times3$ becomes $2^3\times3^2$. The exponent counts how many times the prime appears.

A quick self check is to multiply back. You do not need to fully expand every time. Just sanity check chunks. If you claim $72=2^3\times3^2$, then $2^3=8$ and $3^2=9$, and $8\times9=72$.

This tidy form is also what makes later topics feel almost mechanical. You stop wrestling with the original numbers and start comparing their prime ingredients.

Why uniqueness matters for GCD and LCM

Every whole number greater than 1 has exactly one prime factorisation, ignoring order. This is called unique factorisation. It is the reason the prime method for GCD and LCM works every time.

If you want the GCD, look for primes both numbers share. For each shared prime, take the smaller exponent. If you want the LCM, collect every prime that appears in either number, taking the larger exponent.

GCD is the overlap of recipes. LCM is the combined shopping list. Once you think in those terms, the steps are hard to forget because they match the meaning.

Note: To find GCD and LCM using prime factorisation, write each number as a product of primes. The GCD uses only primes common to both numbers, with the smallest exponents. The LCM uses all primes from both numbers, with the largest exponents.

Mistakes that derail factorisation

Most errors come from stopping at a factor pair that looks finished, or from letting 1 sneak into the prime list.

A few watch outs:

• Stopping at $6\times6$ for 36: Both 6s are composite, so you must keep breaking them into $2\times3$.
• Missing a prime factor in repeated division: If you divide by 2 and 3, check whether the leftover number is still composite.
• Treating 1 as prime: It is not prime because it only has one factor.
• Forgetting that 0 is special: 0 has infinitely many factors because $0=n\times0$ for any $n$, so prime factorisation is not used the same way.
• Negatives: Factor the positive part first, then include a factor of $-1$ if you need to represent the sign.

Checkpoint: When you think you are done, ask if every factor is prime. If any factor is composite, you are not done.

Next steps that make it stick

Mental shortcuts come from divisibility tests and from recognizing small prime patterns. If a number is even, peel off 2s. If the digit sum is divisible by 3, peel off a 3. If it ends in 0 or 5, peel off a 5. After that, the leftover is often prime or a simple product.

Prime factorisation quietly powers two big moves you will use everywhere. It simplifies fractions by canceling shared prime factors, and it supports algebraic factoring by showing what is common inside terms. Pick five numbers you meet this week and factor them fully. The goal is not speed. The goal is to trust that the same primes will show up no matter how you start.