What are the divisors of 5078?

1, 2, 2539, 5078

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

2 even divisors

2, 5078

2 odd divisors

1, 2539

How to compute the divisors of 5078?

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

5078 / 1 = 5078 (the remainder is 0, so 1 is a divisor of 5078)
5078 / 2 = 2539 (the remainder is 0, so 2 is a divisor of 5078)
5078 / 3 = 1692.6666666667 (the remainder is 2, so 3 is not a divisor of 5078)
...
5078 / 5077 = 1.0001969667126 (the remainder is 1, so 5077 is not a divisor of 5078)
5078 / 5078 = 1 (the remainder is 0, so 5078 is a divisor of 5078)

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 5078 (i.e. 71.260087005279). 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$ )

5078 / 1 = 5078 (the remainder is 0, so 1 and 5078 are divisors of 5078)
5078 / 2 = 2539 (the remainder is 0, so 2 and 2539 are divisors of 5078)
5078 / 3 = 1692.6666666667 (the remainder is 2, so 3 is not a divisor of 5078)
...
5078 / 70 = 72.542857142857 (the remainder is 38, so 70 is not a divisor of 5078)
5078 / 71 = 71.521126760563 (the remainder is 37, so 71 is not a divisor of 5078)