What are the divisors of 1929?

1, 3, 643, 1929

4 odd divisors

1, 3, 643, 1929

How to compute the divisors of 1929?

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

  • 1929 / 1 = 1929 (the remainder is 0, so 1 is a divisor of 1929)
  • 1929 / 2 = 964.5 (the remainder is 1, so 2 is not a divisor of 1929)
  • 1929 / 3 = 643 (the remainder is 0, so 3 is a divisor of 1929)
  • ...
  • 1929 / 1928 = 1.0005186721992 (the remainder is 1, so 1928 is not a divisor of 1929)
  • 1929 / 1929 = 1 (the remainder is 0, so 1929 is a divisor of 1929)

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 1929 (i.e. 43.920382511995). 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 )

  • 1929 / 1 = 1929 (the remainder is 0, so 1 and 1929 are divisors of 1929)
  • 1929 / 2 = 964.5 (the remainder is 1, so 2 is not a divisor of 1929)
  • 1929 / 3 = 643 (the remainder is 0, so 3 and 643 are divisors of 1929)
  • ...
  • 1929 / 42 = 45.928571428571 (the remainder is 39, so 42 is not a divisor of 1929)
  • 1929 / 43 = 44.860465116279 (the remainder is 37, so 43 is not a divisor of 1929)