What are the divisors of 12?

1, 2, 3, 4, 6, 12

4 even divisors

2, 4, 6, 12

2 odd divisors

1, 3

How to compute the divisors of 12?

A number N is said to be divisible by a number M (with M non-zero) if, when we divide N by M, the remainder of the division is zero.

N mod M = 0

Brute force algorithm

We could start by using a brute-force method which would involve dividing 12 by each of the numbers from 1 to 12 to determine which ones have a remainder equal to 0.

Remainder = N ( M × N M )

(where N M is the integer part of the quotient)

  • 12 / 1 = 12 (the remainder is 0, so 1 is a divisor of 12)
  • 12 / 2 = 6 (the remainder is 0, so 2 is a divisor of 12)
  • 12 / 3 = 4 (the remainder is 0, so 3 is a divisor of 12)
  • ...
  • 12 / 4 = 3 (the remainder is 0, so 4 is a divisor of 12)
  • 12 / 5 = 2.4 (the remainder is 2, so 5 is not a divisor of 12)
  • 12 / 6 = 2 (the remainder is 0, so 6 is a divisor of 12)
  • 12 / 7 = 1.7142857142857 (the remainder is 5, so 7 is not a divisor of 12)
  • 12 / 8 = 1.5 (the remainder is 4, so 8 is not a divisor of 12)
  • 12 / 9 = 1.3333333333333 (the remainder is 3, so 9 is not a divisor of 12)
  • 12 / 10 = 1.2 (the remainder is 2, so 10 is not a divisor of 12)
  • 12 / 11 = 1.0909090909091 (the remainder is 1, so 11 is not a divisor of 12)
  • 12 / 12 = 1 (the remainder is 0, so 12 is a divisor of 12)

Improved algorithm using square-root

However, there is another slightly better approach that reduces the number of iterations by testing only integers less than or equal to the square root of 12 (i.e. 3.4641016151378). Indeed, if a number N has a divisor D greater than its square root, then there is necessarily a smaller divisor d such that:

D × d = N

(thus, if N D = d , then N d = D )

  • 12 / 1 = 12 (the remainder is 0, so 1 and 12 are divisors of 12)
  • 12 / 2 = 6 (the remainder is 0, so 2 and 6 are divisors of 12)
  • 12 / 3 = 4 (the remainder is 0, so 3 and 4 are divisors of 12)