Visual walkthrough — Factors and multiples — all factors of a number, factor pairs

We build on the parent note. Nothing there is assumed here — we re-earn every symbol.

---

Step 1 — What "factor" even means, drawn as a rectangle

WHAT. A factor of a whole number $n$ is a whole number that fits into $n$ a whole number of times, leaving nothing over. We write this as $n=a\times b.$

• $n$ ::: the number we are breaking apart (the total).
• $a$ ::: one factor — think of it as the number of rows.
• $b$ ::: the partner factor — the number of columns.
• $\times$ ::: "arranged in a grid of" — $a$ rows each holding $b$ items.

WHY a rectangle. Multiplication is rectangle-building. If you can lay out exactly $n$ square tiles in a perfect rectangle with no gaps and no tiles left over, the side lengths of that rectangle are a factor pair. This picture is the whole idea — hold onto it.

PICTURE. Below, $12$ tiles form a $3\times 4$ rectangle. The height is a factor ($3$), the width is a factor ($4$), and together $3\times 4=12$.

---

Step 2 — Every factor drags a partner in with it

WHAT. Pick any factor $a$. Then its partner $b$ is forced: $b=\frac{n}{a}.$

• $\frac{n}{a}$ ::: "$n$ shared into $a$ equal rows" — how many tiles land in each row, which is exactly the width $b$.

Because $a\times b=n$ and $b\times a=n$ (multiplication doesn't care about order), the rectangle you get for $a$ rows is just the rectangle for $a$ columns turned on its side. So factors are never lonely — they arrive two at a time.

WHY this matters. If we ever find one factor $a$, we get $b=n/a$ for free. That is the seed of the shortcut: we don't have to hunt for $b$ separately.

PICTURE. The same $12$ tiles: the $3\times 4$ rectangle flipped becomes $4\times 3$. Same tiles, same total, partner factors swapped. The pair $(3,4)$ and the pair $(4,3)$ describe the same rectangle.

---

Step 3 — Line the pairs up: the small one, then the big one

WHAT. Take all the factor pairs of $n$ and, inside each pair, write the smaller number first: $(a,b)\text{with}a\le b.$

• $a\le b$ ::: "$a$ is the short side, $b$ is the long side" — we always name the shorter side first.

WHY. Sorting each pair puts every short side on the left and every long side on the right. Now watch what happens as the pairs get "more balanced": the short side grows, the long side shrinks, and they march toward each other.

PICTURE. For $n=24$ we stack the rectangles from tallest-thin to squarest. Look at the left column (short sides): $1,2,3,4$ — climbing. Look at the right column (long sides): $24,12,8,6$ — falling. They meet somewhere in the middle.

---

Step 4 — Where do the two sides meet? At $\sqrt{n}$

WHAT. The place where the short side stops being shorter than the long side is where $a=b⟹a\times a=n⟹a=\sqrt{n}.$

• $\sqrt{n}$ ::: the square root of $n$ — the side length of a square holding exactly $n$ tiles.

WHY the square root, and not something else? We need the single number where a rectangle turns into a square, because that is the balance point: to the left of it the short side is genuinely shorter; to the right the roles have flipped. The square root is defined as the answer to "what number times itself gives $n$?" — precisely the balance question we are asking. No other tool answers it.

PICTURE. A number line of the pairs of $24$. The short sides $1,2,3,4$ sit left of $\sqrt{24}\approx 4.9$; the long sides $6,8,12,24$ sit right of it. The dotted line at $\sqrt{24}$ is the mirror.

---

Step 5 — The proof: both sides can't be big

WHAT. Suppose, for contradiction, that both members of a pair were bigger than $\sqrt{n}$: $a>\sqrt{n}\text{and}b>\sqrt{n}.$

Multiply the two inequalities (both sides positive, so the direction is safe): $a\times b>\sqrt{n}\times \sqrt{n}=n.$

• $\sqrt{n}\times \sqrt{n}=n$ ::: by the very definition of square root — the square root undoes the squaring.
• $a\times b>n$ ::: but we said $a\times b=n$. Contradiction!

WHY this settles it. A rectangle whose both sides beat $\sqrt{n}$ would need more than $n$ tiles — it can't be built from only $n$. So it is impossible for both partners to sit on the right of the mirror. Therefore:

PICTURE. A "forbidden zone": a square of side $\sqrt{n}$ shaded, and a rectangle with both sides poking past it — visibly overflowing the $n$-tile budget.

---

Step 6 — The search rule falls out for free

WHAT. Because every pair keeps at least one foot on the left of the mirror, we only need to test candidates $d$ in $d=1,2,3,\dots ,\lfloor \sqrt{n}\rfloor .$

• $d$ ::: the trial short side we are testing.
• $\lfloor \cdot \rfloor$ ::: the floor — round down to the nearest whole number, since side lengths are whole. E.g. $\lfloor \sqrt{24}\rfloor =\lfloor 4.9\rfloor =4$.

For each $d$: if $d$ divides $n$ exactly, record both $d$ and its free partner $n/d$.

WHY it can't miss. Any factor bigger than $\sqrt{n}$ is somebody's long partner — and we already caught it when we tested its short partner on the left. Scanning the left catches the right by reflection.

PICTURE. The scan for $24$: a walker steps $1\to 2\to 3\to 4$, and each hit fires an arrow across the mirror to grab the big partner ($24,12,8,6$).

---

Step 7 — The special case: perfect squares land on the mirror

WHAT. When $n$ is a perfect square, the balance point $\sqrt{n}$ is itself a whole number, so the middle pair is $\left(\sqrt{n},\sqrt{n}\right).$

• Here the short side and long side are the same number — the factor pairs with itself.

WHY it matters. This lone factor sits on the mirror, not reflected across it. So you write it once, not twice. That is exactly why perfect squares have an odd number of factors: every other factor comes in a two, but $\sqrt{n}$ is a solo.

PICTURE. For $36$, the rectangles collapse to a genuine $6\times 6$ square sitting on the mirror line — a single tile, no reflection.

---

Step 8 — The degenerate cases: primes and $n=1$

WHAT & WHY.

• A prime like $17$: scan $1,2,3,4$ ($\lfloor \sqrt{17}\rfloor =4$). Only $1$ divides it. The single pair is $(1,17)$ — exactly two factors, the smallest possible for any number $\ge 2$. No short side other than $1$ ever lands a hit.
• $n=1$: the only pair is $(1,1)$, which is on the mirror ($\sqrt{1}=1$). One factor total — the smallest number of factors any number can have.

PICTURE. Side by side: $17$ as a single $1\times 17$ strip (a prime can only be a strip, never a fatter rectangle), and $1$ as one lonely tile.

---

The one-picture summary

Everything above is a single idea: fold the number line at $\sqrt{n}$, search only the left half, and let reflection hand you the right half.

Recall Feynman retelling — say it to a friend

Imagine you've got $n$ tiles and you're finding every rectangle you can build with them. First trick: every rectangle has a twin — turn it sideways and you get another, so short sides and long sides always come in pairs. Second trick: line all the short sides up on the left and all the long sides on the right. As you go from a tall thin rectangle to a square-ish one, the short side grows and the long side shrinks — they head toward each other and meet exactly where the rectangle becomes a square, at side $\sqrt{n}$. Now the punchline: both sides of a rectangle can't be bigger than $\sqrt{n}$, because that would need more than $n$ tiles. So every rectangle keeps at least one side on the left of that middle line. That means I only ever have to test short sides up to $\sqrt{n}$ — each hit throws me its big partner for free. If $n$ happens to be a perfect square, the middle rectangle is a true square whose side counts just once, which is why perfect squares have an odd number of factors. Primes are the boring rectangles — only the $1\times n$ strip works. That's the whole story: pair up, and stop at the root.

Recall Two-line self-test

Why search only to $\sqrt{n}$? ::: Every factor pair has a member $\le \sqrt{n}$; both being larger would multiply to more than $n$. Why odd factor count for perfect squares? ::: The pair $(\sqrt{n},\sqrt{n})$ is one factor paired with itself, counted once.

---

Connections

• Perfect squares — the on-the-mirror case and the odd-count rule.
• Prime numbers and composite numbers — the degenerate two-factor case.
• Prime factorisation — the deepest way to see all factors at once.
• Divisibility rules — fast tests for "does $d$ divide $n$?" during the scan.
• HCF and LCM — built from shared factors.
• Fractions in lowest terms — cancelling common factors.

Concept Map