What are the divisors of 5884?

1, 2, 4, 1471, 2942, 5884

4 even divisors

2, 4, 2942, 5884

2 odd divisors

1, 1471

How to compute the divisors of 5884?

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 5884 by each of the numbers from 1 to 5884 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)

  • 5884 / 1 = 5884 (the remainder is 0, so 1 is a divisor of 5884)
  • 5884 / 2 = 2942 (the remainder is 0, so 2 is a divisor of 5884)
  • 5884 / 3 = 1961.3333333333 (the remainder is 1, so 3 is not a divisor of 5884)
  • ...
  • 5884 / 5883 = 1.0001699813021 (the remainder is 1, so 5883 is not a divisor of 5884)
  • 5884 / 5884 = 1 (the remainder is 0, so 5884 is a divisor of 5884)

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 5884 (i.e. 76.70723564306). 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 )

  • 5884 / 1 = 5884 (the remainder is 0, so 1 and 5884 are divisors of 5884)
  • 5884 / 2 = 2942 (the remainder is 0, so 2 and 2942 are divisors of 5884)
  • 5884 / 3 = 1961.3333333333 (the remainder is 1, so 3 is not a divisor of 5884)
  • ...
  • 5884 / 75 = 78.453333333333 (the remainder is 34, so 75 is not a divisor of 5884)
  • 5884 / 76 = 77.421052631579 (the remainder is 32, so 76 is not a divisor of 5884)