What are the divisors of 37?
1, 37
- There is a total of 2 positive divisors.
- The sum of these divisors is 38.
- The arithmetic mean is 19.
2 odd divisors
1, 37
How to compute the divisors of 37?
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 37 by each of the numbers from 1 to 37 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 37 / 1 = 37 (the remainder is 0, so 1 is a divisor of 37)
- 37 / 2 = 18.5 (the remainder is 1, so 2 is not a divisor of 37)
- 37 / 3 = 12.333333333333 (the remainder is 1, so 3 is not a divisor of 37)
- ...
- 37 / 36 = 1.0277777777778 (the remainder is 1, so 36 is not a divisor of 37)
- 37 / 37 = 1 (the remainder is 0, so 37 is a divisor of 37)
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 37 (i.e. 6.0827625302982). 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 )
- 37 / 1 = 37 (the remainder is 0, so 1 and 37 are divisors of 37)
- 37 / 2 = 18.5 (the remainder is 1, so 2 is not a divisor of 37)
- 37 / 3 = 12.333333333333 (the remainder is 1, so 3 is not a divisor of 37)
- ...
- 37 / 5 = 7.4 (the remainder is 2, so 5 is not a divisor of 37)
- 37 / 6 = 6.1666666666667 (the remainder is 1, so 6 is not a divisor of 37)