What are the divisors of 4259?
1, 4259
- There is a total of 2 positive divisors.
- The sum of these divisors is 4260.
- The arithmetic mean is 2130.
2 odd divisors
1, 4259
How to compute the divisors of 4259?
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 4259 by each of the numbers from 1 to 4259 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 4259 / 1 = 4259 (the remainder is 0, so 1 is a divisor of 4259)
- 4259 / 2 = 2129.5 (the remainder is 1, so 2 is not a divisor of 4259)
- 4259 / 3 = 1419.6666666667 (the remainder is 2, so 3 is not a divisor of 4259)
- ...
- 4259 / 4258 = 1.0002348520432 (the remainder is 1, so 4258 is not a divisor of 4259)
- 4259 / 4259 = 1 (the remainder is 0, so 4259 is a divisor of 4259)
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 4259 (i.e. 65.261014396039). 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 )
- 4259 / 1 = 4259 (the remainder is 0, so 1 and 4259 are divisors of 4259)
- 4259 / 2 = 2129.5 (the remainder is 1, so 2 is not a divisor of 4259)
- 4259 / 3 = 1419.6666666667 (the remainder is 2, so 3 is not a divisor of 4259)
- ...
- 4259 / 64 = 66.546875 (the remainder is 35, so 64 is not a divisor of 4259)
- 4259 / 65 = 65.523076923077 (the remainder is 34, so 65 is not a divisor of 4259)