Prime factorization — factor trees, ladder method: Foundations

Before you can trust the factor tree or the ladder, you need to be sure of every little symbol the parent note quietly used. Below, each idea is built from nothing, with a picture, before the next one leans on it.

1. What "number" are we even talking about?

Why the fuss? Because "factorize $0$ " or "factorize $1$ " have no sensible answer, and the parent note keeps saying " $n > 1$ ". That $>$ symbol is doing real work — let's define it.

Look at the number line above: the pale-yellow region ( $2$ onward) is where factorization lives. The number $1$ (chalk-pink dot) is the boundary we never step onto.

2. Divides, factor, and the little symbols $\times$ , $\div$ , $∣$

Everything in this chapter is built on one relationship: one number fitting evenly into another.

In the picture, $12$ dots split cleanly into $4$ rows of $3$ — that's why $3 ∣ 12$ . Try to split them into rows of $5$ and you get leftovers — that's why $5 ∤ 12$ (the slash means "does not divide"). This clean-vs-leftover picture is the entire meaning of "factor".

You may already know quick tests for whether $b ∣ a$ without dividing — those are the Divisibility Rules, and they make the ladder fast.

3. Prime vs composite — the atoms and the molecules

The figure shows two rows of dots. A prime like $7$ (chalk-blue) can only be laid out as $1 \times 7$ — you cannot make a proper rectangle. A composite like $12$ (pale-yellow) can be laid out as $3 \times 4$ or $2 \times 6$ — many rectangles. Prime = only the trivial $1 \times n$ rectangle exists. That is what "cannot be split" means, pictured.

A neat way to list the small primes systematically (crossing out composites) is the Sieve of Eratosthenes.

4. Exponents — the $p^{a}$ shorthand

When the same prime block appears many times, writing $2 \times 2 \times 2$ is clumsy. Enter exponents.

5. The product symbol $\prod$ and subscripts $p_{i}, a_{i}$

The parent note writes $n = p_{1}^{a_{1}} p_{2}^{a_{2}} \dots p_{k}^{a_{k}}$ and even $\prod p_{i}^{m i n (a_{i}, b_{i})}$ . Three new symbols hide there.

6. Putting the master formula together

Now every piece of the headline equation is earned:

Prerequisite map

Read top to bottom: counting leads to the divides idea, which splits numbers into primes vs composites; exponents and the product sign package the result; together they build prime factorization, which unlocks uniqueness and the divisor/HCF/LCM payoffs.

Equipment checklist

Test yourself — cover the right side and answer before revealing.

What does

n > 1

exclude, and why?

It excludes

0

and

1

; only numbers from

2

upward can be factorized into primes.

What does

b ∣ a

mean in plain words?

b

divides

a

exactly —

a

splits into equal groups of size

b

with no remainder.

Define a prime using the word "divisors".

A natural number greater than

1

with exactly two divisors:

1

and itself.

Why is

1

neither prime nor composite?

It has only one divisor (itself), so it fails the "exactly two divisors" test; it's a unit.

What is a composite number?

A number greater than

1

with more than two divisors, so it can be split into smaller factors.

Evaluate

2^{3}

and

3^{2}

2^{3} = 8

and

3^{2} = 9

What does the exponent

a

p^{a}

count?

How many copies of the base

p

are multiplied together;

p^{1} = p

p^{0} = 1

What does

\prod p_{i}^{a_{i}}

instruct you to do?

Multiply every prime

p_{i}

raised to its exponent

a_{i}

together.

What do

min (a, b)

and

max (a, b)

give?

The smaller value and the larger value of the two, respectively.

60 = 2^{2} \cdot 3 \cdot 5

, what are

k

, the primes, and the exponents?

k = 3

; primes

2, 3, 5

; exponents

2, 1, 1