What are the divisors of 3?

1, 3

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

2 odd divisors

1, 3

How to compute the divisors of 3?

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

3 / 1 = 3 (the remainder is 0, so 1 is a divisor of 3)
3 / 2 = 1.5 (the remainder is 1, so 2 is not a divisor of 3)
3 / 3 = 1 (the remainder is 0, so 3 is a divisor of 3)

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 3 (i.e. 1.7320508075689). 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$ )

3 / 1 = 3 (the remainder is 0, so 1 and 3 are divisors of 3)