What are the divisors of 59?
1, 59
- There is a total of 2 positive divisors.
- The sum of these divisors is 60.
- The arithmetic mean is 30.
2 odd divisors
1, 59
How to compute the divisors of 59?
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 59 by each of the numbers from 1 to 59 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 59 / 1 = 59 (the remainder is 0, so 1 is a divisor of 59)
- 59 / 2 = 29.5 (the remainder is 1, so 2 is not a divisor of 59)
- 59 / 3 = 19.666666666667 (the remainder is 2, so 3 is not a divisor of 59)
- ...
- 59 / 58 = 1.0172413793103 (the remainder is 1, so 58 is not a divisor of 59)
- 59 / 59 = 1 (the remainder is 0, so 59 is a divisor of 59)
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 59 (i.e. 7.6811457478686). 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 )
- 59 / 1 = 59 (the remainder is 0, so 1 and 59 are divisors of 59)
- 59 / 2 = 29.5 (the remainder is 1, so 2 is not a divisor of 59)
- 59 / 3 = 19.666666666667 (the remainder is 2, so 3 is not a divisor of 59)
- ...
- 59 / 6 = 9.8333333333333 (the remainder is 5, so 6 is not a divisor of 59)
- 59 / 7 = 8.4285714285714 (the remainder is 3, so 7 is not a divisor of 59)