What are the divisors of 116?

1, 2, 4, 29, 58, 116

4 even divisors

2, 4, 58, 116

2 odd divisors

1, 29

How to compute the divisors of 116?

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.

N mod M = 0

Brute force algorithm

We could start by using a brute-force method which would involve dividing 116 by each of the numbers from 1 to 116 to determine which ones have a remainder equal to 0.

Remainder = N ( M × N M )

(where N M is the integer part of the quotient)

  • 116 / 1 = 116 (the remainder is 0, so 1 is a divisor of 116)
  • 116 / 2 = 58 (the remainder is 0, so 2 is a divisor of 116)
  • 116 / 3 = 38.666666666667 (the remainder is 2, so 3 is not a divisor of 116)
  • ...
  • 116 / 115 = 1.0086956521739 (the remainder is 1, so 115 is not a divisor of 116)
  • 116 / 116 = 1 (the remainder is 0, so 116 is a divisor of 116)

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 116 (i.e. 10.770329614269). Indeed, if a number N has a divisor D greater than its square root, then there is necessarily a smaller divisor d such that:

D × d = N

(thus, if N D = d , then N d = D )

  • 116 / 1 = 116 (the remainder is 0, so 1 and 116 are divisors of 116)
  • 116 / 2 = 58 (the remainder is 0, so 2 and 58 are divisors of 116)
  • 116 / 3 = 38.666666666667 (the remainder is 2, so 3 is not a divisor of 116)
  • ...
  • 116 / 9 = 12.888888888889 (the remainder is 8, so 9 is not a divisor of 116)
  • 116 / 10 = 11.6 (the remainder is 6, so 10 is not a divisor of 116)