Welcome! Today we're exploring The Unique Prime Fingerprint of Every Number — a concept that's way more powerful than it sounds.

Think about the number 60. You can split it as:

Factorisation	Result
$2 \times 30$	60
$6 \times 10$	60
$4 \times 15$	60

Different starting points, but they all end at the same collection of primes.

Why does that always happen? And why should you care?

Because this single fact — that every number has a unique prime fingerprint — is the engine behind:

HCF and LCM
Decimal classification
Irrationality proofs

By the end of this section, you'll be able to:

State the Fundamental Theorem of Arithmetic precisely
Use its uniqueness guarantee to make definitive claims about what can and cannot divide a number

1. The two parts of FTA: existence and uniqueness

Factor tree showing 60 splitting three different ways: 2×30, 6×10, and 4×15, all converging to the same prime factors 2×2×3×5 at the bottom

Think about the number 60. You can split it as:

$2 \times 30$
$6 \times 10$
$4 \times 15$

Different starting points, but they all end at the same collection of primes. Why does that always happen?

We're starting with the statement itself. Before you can use the Fundamental Theorem of Arithmetic, you need to know exactly what it claims — and it claims two things, not onekey!.

📋 Given Info

Given Information:

The Fundamental Theorem of Arithmetic (FTA) is a statement about how positive integers relate to prime numbers.

It applies specifically to composite numbers — numbers greater than 1 that are not themselves prime.

✍️ Question

State the Fundamental Theorem of Arithmetic. Make sure your statement has two distinct parts.

Then answer:

Does FTA apply to the number 1??
Does it apply to the number 7??

The Fundamental Theorem of ArithmeticThe master rule about how numbers are built from primes makes two claimsBoth parts matter for exams about composite numbers:

Part 1 — Existence:Yes, you CAN break any composite into primes Every composite number CAN be written as a product of primesIt's guaranteed to work every single time.

This is the less surprising part. Take any composite number, split it into factors, split those factors, keep going — since the pieces get smaller and are all at least 2, the process must stop with all primes.

Factor tree showing 60 splitting into 2 x 30, then 30 into 2 x 15, then 15 into 3 x 5, with prime factors 2, 2, 3, 5 circled at leaves

Part 2 — Uniqueness:The primes you get are FIXED There is only ONE waykey!You can't find different primes giving the same number to write a composite number as a product of primes (ignoring the order of the primesOrder can change but the primes stay the same).

You cannot find a different set of primesThe actual primes are always the same that multiplies to the same number.

✍️ MCQ

Choose one

If someone claims that

60 = 2 \times 5 \times 6

, why does this NOT contradict the uniqueness part of FTA?

✓

In short: Every composite number has a unique prime factorisationEvery composite has exactly ONE prime fingerprint.

ExistenceYou can find the prime factorisation = you CAN always find a prime factorisation
UniquenessThere's only one factorisation to find = there is only ONE such factorisation

✍️ T/F

True or False?

The Fundamental Theorem of Arithmetic guarantees that a prime factorisation exists AND is unique. True or False?

✓

The qualifier 'composite' matters. FTA applies to composite numbersFTA only applies to composite numbers — those with factors beyond 1 and themselvesNumbers that have factors beyond 1 and themselves. What about the edge cases?

The number 1special1 sits in its own special category has no prime factorisationThat's why 1 is neither prime nor composite at all. It is the 'empty product' — neither prime nor composite1 sits in its own special category.

✍️ Yes/No

Yes or No?

Does the Fundamental Theorem of Arithmetic apply to the number

1

?

✓

A prime numberFor primes, factorisation is trivial like $7$ primeA prime like 7 is just itself has a trivial factorisationA prime is a product of one prime: just itself. It is already a product of one prime.Primes are products of one prime FTA is usually stated for composites, but primes fit naturallyPrimes fit naturally into the FTA framework if you allow single-prime products.

✍️ MCQ

Choose one

What is the prime factorisation of the number

7

?

✓

When stating FTA, always include both partsTwo components required for full statement — existence AND uniquenessExistence: can be factored; Uniqueness: only one way — and always say 'composite number,'Because 1 has no prime factors, primes are trivial not just 'number.'

✍️ MCQ

Choose one

Which of the following is a COMPLETE and CORRECT statement of the Fundamental Theorem of Arithmetic? (A) Every number can be written as a product of primes. (B) Every composite number can be written as a product of primes. (C) Every composite number can be written as a product of primes, and this factorisation is unique. (D) Every prime number has exactly two factors.

✓

2. Recognising a valid prime factorisation vs a non-prime factorisation

Think about the number 60. You can split it as:

$2 \times 30$
$6 \times 10$
$4 \times 15$

Different starting points, but they all end at the same collection of primes. Why does that always happen?

You know what FTA claims. Now let's make sure you can tell the difference between a genuine prime factorisation and something that merely looks like one.

This distinction trips up students constantly.

✍️ Question

Here's a scenario: 🤔

A student says:

"I found two different factorisations of 180: one is $4 \times 9 \times 5$ , and the other is $2^{2} \times 3^{2} \times 5$ . So FTA is wrong — there are two factorisations!"

Explain the student's error.

The key word in FTA is prime.'

FTA says the prime factorisationThe theorem only applies to prime factors is unique — not that every factorisation into any factors is unique.

So $180 = 4 \times 9 \times 5$ These aren't prime — need to break them down further and $180 = 2^2 \times 3^2 \times 5$ This one uses only primes are both valid factorisations, but only the second one uses only prime factors.

✍️ Yes/No

Yes or No?

Is

4 \times 9 \times 5

a prime factorisation of

180

?

✓

Look at 180. You can write it many ways:

$180 = 4 \times 45$
$180 = 9 \times 20$
$180 = 4 \times 9 \times 5$
$180 = 2 \times 2 \times 3 \times 3 \times 5$

All of these are true factorisations of 180.

But only the last one is a PRIME factorisationEvery factor must be prime to count — every factor in it is prime.

The others contain composite factors (4, 9, 20, 45)compositeThese are composite, not prime, so they are not prime factorisationsDoesn't count as prime factorisation.

✍️ MCQ

Choose one

Which of the following is the prime factorisation of

180

?

✓

When you break $4 \times 9 \times 5$ fully into primes, you get:

(2 \times 2) \times (3 \times 3) \times 5 = 2^2 \times 3^2 \times 5

That's the same prime factorisation as the student's other expression. So there really is only one prime factorisationOnce broken down to primes, you always reach the same result — the student just hadn't finished breaking down the first one!

✍️ T/F

True or False?

The student's error was that they compared a non-prime factorisation (

4 \times 9 \times 5

) with a prime factorisation (

2^2 \times 3^2 \times 5

). True or False?

✓

The test for whether something is a prime factorisation: Is every factorEach factor must pass the prime test in it a prime numberIf even one factor is not prime, you're not done?

If any factor is compositeYour signal to keep splitting, you're not done — keep splittingDon't stop until every factor passes the prime test.

✍️ T/F

True or False?

The student's factorisation

4 \times 9 \times 5

is a prime factorisation of

180

. True or False?

✓

3. Using FTA uniqueness to rule out a prime factor

Think about the number 60. You can split it as:

$2 \times 30$
$6 \times 10$
$4 \times 15$

Factor tree showing 60 split three ways: 2×30, 6×10, and 4×15, all converging to the same prime factors 2×2×3×5 at the bottom

— different starting points, but they all end at the same collection of primes.

Why does that always happen?Key Q

Now we get to the real power of the Fundamental Theorem of Arithmetic.

Existence tells you primes are there
Uniqueness tells you which primes are NOT there

And that's what makes definitive arguments possible.

Once you know the prime factorisation of a number, FTA uniqueness tells you that no other prime factorisation exists.

If a prime does not appear in the factorisation, it truly cannot divide the number — there is no hidden alternative factorisation where it might appear.

✍️ Question

The prime factorisation of $4^n$ is $2^{2n}$ (since $4 = 2^{2}$ ).

Using FTA, explain why the number 5 can never divide $4^n$ not a factor, no matter how large $n$ is.

Why would checking examples like $4, 16, 64, 256$ not be enough?

Here's the argument, step by step.

Start with the factorisation: $4 = 2^2$ , so $4^n = (2^2)^n = 2^{2n}$ .

Now, $2^{2n}$ This is the complete prime factorisation is already fully factorised into primes — the only prime present is 2only primeThe only prime in the factorisation. No 3, no 5, no 7, nothing elseThese primes can never appear.

✍️ Yes/No

Yes or No?

According to FTA uniqueness, if

5

does not appear in the prime factorisation of

4^n = 2^{2n}

, can

5

ever divide

4^n

?

✓

Could 5 somehow divide this number through some other route? This is where FTA uniqueness does its work.

FTA says the prime factorisation is the ONLYExactly one way to write any number as a product of primes one. There is no secret alternative factorisation of $2^{2 n}$ that sneaks in a factor of 5.

If 5 divided the numbernot possibleThe prime must appear in the factorisation to divide it, 5 would have to appear in the prime factorisation — but the only prime there is 2No factor of 5 can sneak in anywhere.

✍️ MCQ

Choose one

Why is checking examples like

4, 16, 64, 256

not enough to prove that 5 never divides

4^n

?

✓

Why can't you just check examples?

Because $4^{1} = 4$ , $4^{2} = 16$ , $4^{3} = 64$ — none divisible by 5.

But you've only checked three valuesAny finite number of checks is insufficient of $n$ . What about $4^{10000}$ ? Or $4^{1000000000}$ ?

You can't check them all.

The FTA argument covers every $n$ at once:

The prime factorisation of $4^{n}$ is always $2^{2 n}$ — it has only 2skeyThe factorisation contains nothing but 2s, for any value of $n$ , period.

Since 5 never appears in the factorisation, and FTA says this factorisation is uniqueOnly ONE way to break into primes, 5 can never divide $4^n$ Single proof handles all values of n.

✍️ Yes/No

Yes or No?

The prime factorisation of

6^n

is

2^n \times 3^n

. Using FTA, can the number 7 ever divide

6^n

?

✓

This is the real muscle of uniqueness — it lets you make statements about ALLUniqueness lets you prove for ALL cases, not just tested ones values, not just the ones you've checked.

Without FTA, you'd be stuck saying "I checked a few cases and 5 didn't divide any of them." With FTA, you can confidently say "5 will never divide $4^n$ Not guessing from examples — proven mathematically for any value of $n$ " — and you've proven it mathematicallykeyUsing the theorem gives you mathematical proof, not just guessed it from examples.

4. The prime fingerprint idea and why it matters going forward

Think about the number 60.

You can split it as:

$2 \times 30$
$6 \times 10$
$4 \times 15$

— different starting points, but they all end at the same collection of primes.

Why does that always happen?

You can now state FTA, spot fake factorisations, and use uniqueness to rule out prime factors. The last piece is seeing how this all connects — why a unique factorisation turns every number into a kind of identity card.

Every composite number has a unique prime factorisation.

Think of it as a fingerprint: the number 504example is uniquely identified by $\{2^3, 3^2, 7\}$ , and no other number shares that exact combination of prime powers.

Visual fingerprint card for 504 showing three prime factor boxes: 2 cubed (with 3 small 2s), 3 squared (with 2 small 3s), and 7 (with 1 small 7), arranged like an ID card with 504 as the header

✍️ Question

Your turn to think 🤔

Explain in your own words why the 'prime fingerprint' makes it possible to compute HCF and LCM mechanically by comparing prime powers.

What would go wrong if FTA were false — if a number could have two different prime factorisations?

Two identity cards side by side: left card labeled '504' showing 2^3, 3^2, 7^1; right card labeled '990' showing 2^1, 3^2, 5^1, 11^1

Think of every number as having an identity card listing its prime factors and their powers:

$504 \to {2^{3}, 3^{2}, 7^{1}}$
$990 \to {2^{1}, 3^{2}, 5^{1}, 11^{1}}$

Just like your Aadhaar cardYour Aadhaar is your unique identifier uniquely identifies you, this prime fingerprintEvery number has exactly one unique combination of primes uniquely identifies the number.

FTA guarantees each number has exactly one such card.The foundation that makes everything else work That's what makes comparison possible.

If two numbers share a prime on their cards, we can directly compare the powers. If a prime is missing from a cardYou know for certain it's not a factor, we know it's not a factor — no guessing neededkey!No guessing needed when a prime is absent.

✍️ MCQ

Choose one

To find the HCF of

504

and

990

, we look at primes that appear on both cards. For the prime

2

, which power do we pick for the HCF?

✓

For HCF, we take the minimumHCF takes minimum power since it must divide both power of each common prime — because HCF must divide both numbers.

For LCM, we take the maximumLCM takes maximum power since both must divide it power of each prime — because LCM must be divisible by both.

The fingerprint makes this completely mechanicalJust compare and pick the right powers — just compare the cards!

For HCF (the largest number dividing both), you look at each prime that appears on BOTHIf a prime is missing from either number, it cannot be in the HCF cards and take the smaller powerAlways take the smaller power — that's non-negotiable.

Two overlapping cards showing prime factorizations: Card A with 2^3, 3^2 and Card B with 2^1, 3^2, 5^1, 7^1, 11^1. Highlight the overlap region showing common primes 2 and 3, with smaller powers (2^1, 3^2) circled

Prime 2: $\min (3, 1) = 1$
Prime 3: $\min (2, 2) = 2$
Primes 5, 7, 11They're not common to both, so they don't contribute to HCF are not on both cards — skip themThis is the pattern for finding HCF.

✍️ MCQ

Choose one

Why do we skip prime 7 when computing HCF of 504 and 990?

✓

\text{HCF} = 2^1 \times 3^2 = 2 \times 9 = 18

HCF(Just by taking minimum powers of common primes)

For LCMThe key rule for finding LCM (the smallest multiple of both), take the larger powerAlways take the larger power for LCM of every prime on eitherInclude all primes from both numbers card.

Prime 2: $\max (3, 1) = 3$
Prime 3: $\max (2, 2) = 2$
Primes 5, 7, 11Include primes even if they appear in only one number: take whatever power exists (1 each).

✍️ MCQ

Choose one

When finding the LCM, why do we include primes that appear on only ONE of the two cards?

✓

\text{LCM} = 2^3 \times 3^2 \times 5 \times 7 \times 11 = 8 \times 9 \times 5 \times 7 \times 11 = 27720

Now imagine FTA were falseThe same number could have different prime breakdowns — suppose 504 could also be factorised as $2^{1} \times 3^{3} \times (some other prime arrangement)$ . Then "the power of 2 in 504"You'd get different answers from different factorisations wouldn't be a single number — it could be 3 or 1 depending on which factorisation you looked at.

The min/max comparison would give different answers depending on your choice. The whole method collapses.Without uniqueness, comparing powers simply cannot work

Uniqueness is what pins down a single power for each prime, making the comparison deterministic.This is what makes our method deterministic

✍️ MCQ

Choose one

If a number could have two different prime factorisations, what would happen to the HCF/LCM calculation method?

✓