Factors and multiples — all factors of a number, factor pairs: Question bank

The picture below is the mental model behind every question here: a factor pair is a rectangle of dots, and the search "walks up to the square". Keep it in mind — several answers below ("the small buddy drags in the big partner", the perfect-square self-pairing) are just this rectangle picture read out in words.

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

True or false — justify

Every statement below is either always-true or has a hidden counter-case. Decide and say why. (Remember: "number" = positive integer.)

Every positive integer has at least two factors.

False. The number

1

has exactly one factor — itself — since

1 = 1 \times 1

and there is no smaller positive integer to pair it with. Every positive integer

\geq 2

has at least two.

The largest factor of

n

(other than

n

itself) is always

n /2

False. Every proper factor is a co-factor

n / p

where

p

is some factor

> 1

; to make

n / p

biggest you pick

p

smallest, i.e. the smallest prime factor. For

n = 15

that smallest prime factor is

3

, giving largest proper factor

15/3 = 5

— not

n /2 = 7.5

. The

n /2

rule only wins when

2

is a factor.

a

is a factor of

n

, then

n

is a factor of

a

False — the relationship is one-directional.

3

is a factor of

12

, but

12

does not divide

3

. It flips to "

n

is a multiple of

a

", not a factor.

A number and its factors are the same set as that number's multiples.

False. Factors are finite and all

\leq n

; multiples are infinite and all

\geq n

. Only

n

itself sits in both lists.

Every factor of

n

appears in some factor pair

(d, n / d)

True. If

a

divides

n

then

b = n / a

is a positive integer and

a \times b = n

, so

a

is automatically half of the pair

(a, n / a)

— the width and height of one dot-rectangle.

The number of factors of

n

is always even.

False. It's even unless

n

is a perfect square, where the pair

(n, n)

counts one factor once, making the total odd.

d

divides both

a

and

b

, then

d

divides

a + b

True. Write

a = d \cdot k

and

b = d \cdot m

; then

a + b = d (k + m)

, which is

d

times a whole number — so

d

is a factor of the sum.

Two different positive integers can share all the same factors.

False. If two numbers had exactly the same factor set, they'd share

n

itself as their largest factor, forcing them to be equal.

Spot the error

Each line contains one flawed step or claim. Name what's wrong.

"To list factors of

50

, I scan

d = 1

⌊ 50 ⌋ = 7

, and since

7

doesn't divide

50

there's no factor near there."

The false inference is "

7

isn't a factor, therefore nothing useful lives near there." The scan doesn't need

7

itself to be a factor — within the same range

2

and

5

do divide, handing you

25

and

10

. A non-dividing

d

is meant to fail silently, not to signal an empty region.

36

is a perfect square, so I write its factors as

1, 2, 3, 4, 6, 6, 9, 12, 18, 36

The middle factor

6 = 36

is written twice. In the dot picture it's the square rectangle

6 \times 6

, whose side is one number, so list it once:

1, 2, 3, 4, 6, 9, 12, 18, 36

— nine factors.

1

isn't really a factor of

7

because

1

is trivial and

7

is prime."

1

divides every number since

n = 1 \times n

. A prime has exactly two factors —

1

and itself — so

1

is one of the two, not excluded.

0

is a factor of

12

because

0

divides everything."

Backwards, and it ignores that we test factors by multiplication (division by

0

is undefined).

0 \times k = 0 \neq = 12

for any

k

, so

0

is a factor of nothing but

0

. What's true is that everything is a factor of

0

"Since

6 \times 4 = 24

and

4 \times 6 = 24

, the number

24

has the factor pair

(6, 4)

and also

(4, 6)

, so that's two extra factors."

(6, 4)

and

(4, 6)

are the same unordered pair — the same

4 \times 6

rectangle just rotated. They contribute the two factors

4

and

6

once, not twice.

45 \approx 6.7

, so I scan up to

6

; but

9

is a factor of

45

and

9 > 6.7

, so the

n

rule is broken."

Not broken.

9

enters as the big partner of

5

(since

5 \times 9 = 45

and

5 \leq 6.7

). Every big side of a rectangle is dragged in by its small side.

12

and

18

have no common factors above

1

because they're different."

They share

2, 3

and

6

. Different numbers routinely share factors; that shared-factor idea is exactly what HCF and LCM is built on.

Why questions

Answer with the reasoning, not just the fact.

Why do we only scan up to

n

instead of up to

n

Because if both members of a pair exceeded

n

, their product would exceed

n \times n = n

, contradicting

a \times b = n

. So one member is always

\leq n

— scanning that far catches every rectangle.

Why does finding one factor

d

hand you a second factor for free?

Because

n = d \times (n / d)

, so the quotient

n / d

is automatically a whole-number factor. Factors are born in pairs, never alone — the two sides of one dot-rectangle.

Why must every factor of

n

be at most

n

A factor multiplies by a positive whole number

\geq 1

to reach

n

; if

a > n

then even

a \times 1 > n

, so

a

can't fit. Hence

1 \leq a \leq n

Why does a prime have exactly two factors?

By definition a prime

p

can only be written as

1 \times p

. No middle factor exists, so its factor list is precisely

{1, p}

— two entries.

Why does knowing the Prime factorisation of

n

let you count factors without listing them?

Each factor is built by choosing how many of each prime to include; the choices multiply out to

(e_{1} + 1) (e_{2} + 1) \dots

, giving the total count directly from the exponents.

Why is checking divisibility enough to decide if

d

is a factor?

"Factor" means "divides with remainder

0

", and a divisibility rule is just a fast test for exactly that remainder-zero condition — same question, quicker answer.

Why does cancelling common factors put a fraction in lowest terms?

Dividing top and bottom by a shared factor removes it from both without changing the value; when no common factor above

1

remains, the fraction can't be simplified further.

Edge cases

The scenarios people forget to test.

How many factors does

1

have, and what is its only factor pair?

Exactly one factor:

1

itself. Its only pair is

(1, 1)

— the

1 \times 1

square, a number pairing with itself.

0

a factor of any number, and is any number a factor of

0

0

is a factor of nothing except

0

: the test

n = 0 \times k

forces

n = 0

(and you can never divide by

0

). But every positive integer is a factor of

0

, since

0 = k \times 0

Do we count negative divisors like

- 3

as factors of

12

Not on this page: our domain is positive integers, so we list only

1, 2, 3, 4, 6, 12

. Although

- 3 \times - 4 = 12

is true arithmetically, "factor" here always means a positive one.

What are the factor pairs of a prime like

17

Only

(1, 17)

. Scanning

d = 1

⌊ 17 ⌋ = 4

finds just

1

dividing it, confirming exactly two factors.

For a perfect square such as

49

, what happens at

d = n

d = 7

the quotient is also

7

, so the pair is

(7, 7)

— the square rectangle, a factor meeting itself. You record

7

once, which is why

49

has an odd factor count (three:

1, 7, 49

Does the smallest possible number

n = 1

satisfy "

1

and

n

are always factors"?

Yes but they coincide — here

1

n

, so the two "always-factors" collapse into a single factor. It's the only case where the two rules describe the same number.

n

is prime, does the

n

rule still need a full scan?

Yes — you still test every

d

from

1

⌊ n ⌋

to confirm none divide

n

. Finding no divisor in that range is precisely the proof of primality.

Can a number be its own factor pair partner without being a perfect square?

No.

d = n / d

forces

d^{2} = n

, meaning

n

must be a perfect square. Self-pairing and perfect-square-ness are the same condition.

Connections

Prime numbers and composite numbers — factor counts of $1$ , $2$ , and beyond.
Prime factorisation — why exponents give the factor count.
HCF and LCM — shared factors across two numbers.
Divisibility rules — the fast remainder-zero tests.
Perfect squares — the odd-factor-count edge case.
Fractions in lowest terms — cancelling common factors.