What are the divisors of 45?

1, 3, 5, 9, 15, 45

There is a total of 6 positive divisors.
The sum of these divisors is 78.
The arithmetic mean is 13.

6 odd divisors

1, 3, 5, 9, 15, 45

How to compute the divisors of 45?

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 45 by each of the numbers from 1 to 45 to determine which ones have a remainder equal to 0.

$Remainder = N - (M \times ⌊ \frac{N}{M} ⌋)$

(where $⌊ \frac{N}{M} ⌋$ is the integer part of the quotient)

45 / 1 = 45 (the remainder is 0, so 1 is a divisor of 45)
45 / 2 = 22.5 (the remainder is 1, so 2 is not a divisor of 45)
45 / 3 = 15 (the remainder is 0, so 3 is a divisor of 45)
...
45 / 44 = 1.0227272727273 (the remainder is 1, so 44 is not a divisor of 45)
45 / 45 = 1 (the remainder is 0, so 45 is a divisor of 45)

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 45 (i.e. 6.7082039324994). 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 \times d = N$

(thus, if $\frac{N}{D} = d$ , then $\frac{N}{d} = D$ )

45 / 1 = 45 (the remainder is 0, so 1 and 45 are divisors of 45)
45 / 2 = 22.5 (the remainder is 1, so 2 is not a divisor of 45)
45 / 3 = 15 (the remainder is 0, so 3 and 15 are divisors of 45)
...
45 / 5 = 9 (the remainder is 0, so 5 and 9 are divisors of 45)
45 / 6 = 7.5 (the remainder is 3, so 6 is not a divisor of 45)