What are the divisors of 11?

1, 11

There is a total of 2 positive divisors.
The sum of these divisors is 12.
The arithmetic mean is 6.

2 odd divisors

1, 11

How to compute the divisors of 11?

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 11 by each of the numbers from 1 to 11 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)

11 / 1 = 11 (the remainder is 0, so 1 is a divisor of 11)
11 / 2 = 5.5 (the remainder is 1, so 2 is not a divisor of 11)
11 / 3 = 3.6666666666667 (the remainder is 2, so 3 is not a divisor of 11)
...
11 / 4 = 2.75 (the remainder is 3, so 4 is not a divisor of 11)
11 / 5 = 2.2 (the remainder is 1, so 5 is not a divisor of 11)
11 / 6 = 1.8333333333333 (the remainder is 5, so 6 is not a divisor of 11)
11 / 7 = 1.5714285714286 (the remainder is 4, so 7 is not a divisor of 11)
11 / 8 = 1.375 (the remainder is 3, so 8 is not a divisor of 11)
11 / 9 = 1.2222222222222 (the remainder is 2, so 9 is not a divisor of 11)
11 / 10 = 1.1 (the remainder is 1, so 10 is not a divisor of 11)
11 / 11 = 1 (the remainder is 0, so 11 is a divisor of 11)

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 11 (i.e. 3.3166247903554). 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$ )

11 / 1 = 11 (the remainder is 0, so 1 and 11 are divisors of 11)
11 / 2 = 5.5 (the remainder is 1, so 2 is not a divisor of 11)
11 / 3 = 3.6666666666667 (the remainder is 2, so 3 is not a divisor of 11)