1.1.7 · D4Arithmetic & Number Systems

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

2,609 words12 min readBack to topic

Quick reminder of the two tools you'll lean on:

  • A number is a factor of if for some whole number (nothing left over).
  • The search rule: test every whole from to (the biggest whole number whose square is still ). Each time divides , record the pair .

Here means "round down to the nearest whole number" — so . We need this because is often not a whole number, but we can only test whole numbers.

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

The figure above is the picture behind every problem: laying tiles into rectangles. Each rectangle's two side lengths form one factor pair. Keep it in your mind's eye throughout.


Level 1 — Recognition

L1.1

Is a factor of ? Is a factor of ?

Recall Solution

WHAT we do: check whether the division leaves remainder . exactly (remainder ), because . So == is a factor of ==. remainder (since , and ). So == is not a factor of ==.

L1.2

Which of these are factor pairs of ? , , , .

Recall Solution

A pair is a factor pair of only if exactly.

  • :
  • :
  • :
  • : Factor pairs among these: and .

L1.3

Fill the missing partner: is a factor pair of .

Recall Solution

Every factor pair multiplies to , so the partner of is . . Answer: , and indeed .


Level 2 — Application

L2.1

List all factors of using the rule. State first.

Recall Solution

Step 1 — find the stopping point. We need the biggest whole with . Since and , we get . Step 2 — scan to , recording each time divides:

pair?
1 45
2 ❌ ( is odd)
3 15
4
5 9
6

All factors of : — six factors.

L2.2

List all factors of . Is a perfect square, and does its factor count match the "odd count" rule?

Recall Solution

(since exactly — so is a perfect square).

pair
1 100
2 50
4 25
5 20
10 10 ← same number

( don't divide .) The middle pair is : we write once. Factors: nine factors (odd ✅). This matches the rule from Perfect squares: the square root pairs with itself, so the total is odd.

L2.3

List all factors of .

Recall Solution

(since ). Test : only divides (it's odd, not divisible by ; all leave remainders). Factors: — exactly two, so is a prime (Prime numbers and composite numbers).


Level 3 — Analysis

L3.1

Without listing them, how many factors does a number have if it is a perfect square? Explain using the pairing picture, then verify with .

Recall Solution

Reasoning: factors come in pairs , so they'd total an even number — unless one pair has , i.e. . That happens exactly when is a perfect square. That lone self-paired factor is counted once, breaking the evenness. So a perfect square always has an odd number of factors. Verify with : . Factors: . That's three factors, odd ✅.

L3.2

A number has exactly factors. What can you say about ? Give the smallest three such numbers.

Recall Solution

WHAT the count tells us: an odd count () means is a perfect square (from L3.1). But a perfect square has many factors unless it's built as simply as possible. WHY exactly 3: the three factors must be , , and . For there to be no others, itself must be prime — because if had a factor with , then and would be extra factors. Conclusion: is the square of a prime, . Smallest three: (factors ), (factors ), (factors ). (Note: is skipped because is not prime — has factors , five of them.)

L3.3

Which number in has the most factors? Show all three factor lists.

Recall Solution

Apply the rule to each (, , ).

  • : pairs → factors 6.
  • : ; pairs → factors 4.
  • : pairs → factors 6. Most factors: and tie with 6 each; has fewest with .

Level 4 — Synthesis

L4.1

Two numbers and . Find their common factors by listing each set, then state the largest one (this is the HCF).

Recall Solution

Factors of (): pairs . Factors of (): pairs . Common factors (in both lists): . Largest common factor (HCF): . This is exactly the HCF and LCM idea — the biggest number dividing both.

L4.2

The fraction . Use a common factor to write it in lowest terms.

Recall Solution

Idea: dividing top and bottom by a shared factor doesn't change the fraction's value (Fractions in lowest terms). Common factors of and : from their factor lists, the largest shared factor (HCF) is . Now and share only the factor , so is in lowest terms.

L4.3

A rectangular garden must have a whole-number area of square metres and whole-number side lengths. How many distinct rectangle shapes are possible (a and count as the same shape)?

Recall Solution

Translate: each rectangle is a factor pair with . Distinct shapes = distinct unordered pairs = number of factor pairs. Scan to (since ):

pair
1 72
2 36
3 24
4 18
6 12
8 9

( don't divide .) That's 6 factor pairs → 6 distinct rectangles. (Check: has factors; since is not a perfect square, pairs = ✅.)


Level 5 — Mastery

L5.1

Find the smallest whole number greater than that has exactly factors. Justify why nothing smaller works.

Recall Solution

Strategy: test numbers upward, counting factors with the rule, until we hit a count of .

  • : factors .
  • : .
  • : .
  • : . : . : . : . : . : . : .
  • : ; pairs 6 factors ✅. Every number from to has fewer than factors (max was ), so nothing smaller qualifies. Answer: .

L5.2

Two positive whole numbers multiply to and their difference is smallest possible. Which factor pair is it, and how does the rule locate it instantly?

Recall Solution

Insight: the two factors are closest together right at the "middle" of the pair list — near . That's precisely where the scan ends, so the last valid pair it records is the tightest one. (since ). Scanning:

difference
1 84 83
2 42 40
3 28 25
4 21 17
6 14 8
7 12 5

( don't divide .) The last pair, , has the smallest difference . Answer: . The pairs march from "far apart" toward "close together" as climbs to — so the final recorded pair is always the most balanced. ( isn't a perfect square, so no exact pair exists; straddles .)

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

The figure above draws each factor pair of as a horizontal bar between its two members. Read it top to bottom: as climbs toward (the dashed red line), the bars shrink — the two endpoints crowd together. The bottom bar , shown in red, is the shortest, which is exactly why it wins the "smallest difference" contest. This is the geometric reason the last recorded pair is always the most balanced.

L5.3

Design challenge: build the smallest number whose factors are exactly — no more, no fewer. Verify by the rule. Then explain, using Prime factorisation, why the factor set forces this number.

Recall Solution

Read the set: the largest factor of any number is the number itself. So . Verify: ; pairs . Exactly the target set ✅. Why prime factorisation locks it in: . Its factors are every product with and — that's combinations, matching the six-element set. No smaller number produces this exact set, because the set contains , which pins the answer down completely.


Recall Final self-test (cover the answers)

Factor count of ? ::: . Smallest number with exactly factors? ::: (it is ). HCF of and ? ::: . Distinct rectangles with area ? ::: . Most balanced factor pair of ? ::: .

Connections

  • Prime numbers and composite numbers — factor counts of (prime) vs (prime squared) vs more (composite).
  • Prime factorisation — powers the L5.3 "why this set" argument.
  • HCF and LCM — L4.1 and L4.2 are HCF in disguise.
  • Divisibility rules — speeds up the scan.
  • Perfect squares — the odd-factor-count backbone of L3.
  • Fractions in lowest terms — L4.2 cancels a common factor.