What are the divisors of 5929?

1, 7, 11, 49, 77, 121, 539, 847, 5929

9 odd divisors

1, 7, 11, 49, 77, 121, 539, 847, 5929

How to compute the divisors of 5929?

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

  • 5929 / 1 = 5929 (the remainder is 0, so 1 is a divisor of 5929)
  • 5929 / 2 = 2964.5 (the remainder is 1, so 2 is not a divisor of 5929)
  • 5929 / 3 = 1976.3333333333 (the remainder is 1, so 3 is not a divisor of 5929)
  • ...
  • 5929 / 5928 = 1.0001686909582 (the remainder is 1, so 5928 is not a divisor of 5929)
  • 5929 / 5929 = 1 (the remainder is 0, so 5929 is a divisor of 5929)

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 5929 (i.e. 77). 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 )

  • 5929 / 1 = 5929 (the remainder is 0, so 1 and 5929 are divisors of 5929)
  • 5929 / 2 = 2964.5 (the remainder is 1, so 2 is not a divisor of 5929)
  • 5929 / 3 = 1976.3333333333 (the remainder is 1, so 3 is not a divisor of 5929)
  • ...
  • 5929 / 76 = 78.013157894737 (the remainder is 1, so 76 is not a divisor of 5929)
  • 5929 / 77 = 77 (the remainder is 0, so 77 and 77 are divisors of 5929)