What are the divisors of 57?
1, 3, 19, 57
- There is a total of 4 positive divisors.
- The sum of these divisors is 80.
- The arithmetic mean is 20.
4 odd divisors
1, 3, 19, 57
How to compute the divisors of 57?
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 57 by each of the numbers from 1 to 57 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 57 / 1 = 57 (the remainder is 0, so 1 is a divisor of 57)
- 57 / 2 = 28.5 (the remainder is 1, so 2 is not a divisor of 57)
- 57 / 3 = 19 (the remainder is 0, so 3 is a divisor of 57)
- ...
- 57 / 56 = 1.0178571428571 (the remainder is 1, so 56 is not a divisor of 57)
- 57 / 57 = 1 (the remainder is 0, so 57 is a divisor of 57)
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 57 (i.e. 7.5498344352707). 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 )
- 57 / 1 = 57 (the remainder is 0, so 1 and 57 are divisors of 57)
- 57 / 2 = 28.5 (the remainder is 1, so 2 is not a divisor of 57)
- 57 / 3 = 19 (the remainder is 0, so 3 and 19 are divisors of 57)
- ...
- 57 / 6 = 9.5 (the remainder is 3, so 6 is not a divisor of 57)
- 57 / 7 = 8.1428571428571 (the remainder is 1, so 7 is not a divisor of 57)