What are the divisors of 5833?

1, 19, 307, 5833

4 odd divisors

1, 19, 307, 5833

How to compute the divisors of 5833?

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

  • 5833 / 1 = 5833 (the remainder is 0, so 1 is a divisor of 5833)
  • 5833 / 2 = 2916.5 (the remainder is 1, so 2 is not a divisor of 5833)
  • 5833 / 3 = 1944.3333333333 (the remainder is 1, so 3 is not a divisor of 5833)
  • ...
  • 5833 / 5832 = 1.0001714677641 (the remainder is 1, so 5832 is not a divisor of 5833)
  • 5833 / 5833 = 1 (the remainder is 0, so 5833 is a divisor of 5833)

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 5833 (i.e. 76.37407937252). 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 )

  • 5833 / 1 = 5833 (the remainder is 0, so 1 and 5833 are divisors of 5833)
  • 5833 / 2 = 2916.5 (the remainder is 1, so 2 is not a divisor of 5833)
  • 5833 / 3 = 1944.3333333333 (the remainder is 1, so 3 is not a divisor of 5833)
  • ...
  • 5833 / 75 = 77.773333333333 (the remainder is 58, so 75 is not a divisor of 5833)
  • 5833 / 76 = 76.75 (the remainder is 57, so 76 is not a divisor of 5833)