What are the divisors of 8159?

1, 41, 199, 8159

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

4 odd divisors

1, 41, 199, 8159

How to compute the divisors of 8159?

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

8159 / 1 = 8159 (the remainder is 0, so 1 is a divisor of 8159)
8159 / 2 = 4079.5 (the remainder is 1, so 2 is not a divisor of 8159)
8159 / 3 = 2719.6666666667 (the remainder is 2, so 3 is not a divisor of 8159)
...
8159 / 8158 = 1.0001225790635 (the remainder is 1, so 8158 is not a divisor of 8159)
8159 / 8159 = 1 (the remainder is 0, so 8159 is a divisor of 8159)

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 8159 (i.e. 90.327183062465). 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$ )

8159 / 1 = 8159 (the remainder is 0, so 1 and 8159 are divisors of 8159)
8159 / 2 = 4079.5 (the remainder is 1, so 2 is not a divisor of 8159)
8159 / 3 = 2719.6666666667 (the remainder is 2, so 3 is not a divisor of 8159)
...
8159 / 89 = 91.674157303371 (the remainder is 60, so 89 is not a divisor of 8159)
8159 / 90 = 90.655555555556 (the remainder is 59, so 90 is not a divisor of 8159)