What are the divisors of 2579?
1, 2579
- There is a total of 2 positive divisors.
- The sum of these divisors is 2580.
- The arithmetic mean is 1290.
2 odd divisors
1, 2579
How to compute the divisors of 2579?
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.
Brute force algorithm
We could start by using a brute-force method which would involve dividing 2579 by each of the numbers from 1 to 2579 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 2579 / 1 = 2579 (the remainder is 0, so 1 is a divisor of 2579)
- 2579 / 2 = 1289.5 (the remainder is 1, so 2 is not a divisor of 2579)
- 2579 / 3 = 859.66666666667 (the remainder is 2, so 3 is not a divisor of 2579)
- ...
- 2579 / 2578 = 1.000387897595 (the remainder is 1, so 2578 is not a divisor of 2579)
- 2579 / 2579 = 1 (the remainder is 0, so 2579 is a divisor of 2579)
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 2579 (i.e. 50.783855702378). Indeed, if a number N has a divisor D greater than its square root, then there is necessarily a smaller divisor d such that:
(thus, if , then )
- 2579 / 1 = 2579 (the remainder is 0, so 1 and 2579 are divisors of 2579)
- 2579 / 2 = 1289.5 (the remainder is 1, so 2 is not a divisor of 2579)
- 2579 / 3 = 859.66666666667 (the remainder is 2, so 3 is not a divisor of 2579)
- ...
- 2579 / 49 = 52.632653061224 (the remainder is 31, so 49 is not a divisor of 2579)
- 2579 / 50 = 51.58 (the remainder is 29, so 50 is not a divisor of 2579)