What are the divisors of 3899?

1, 7, 557, 3899

4 odd divisors

1, 7, 557, 3899

How to compute the divisors of 3899?

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

  • 3899 / 1 = 3899 (the remainder is 0, so 1 is a divisor of 3899)
  • 3899 / 2 = 1949.5 (the remainder is 1, so 2 is not a divisor of 3899)
  • 3899 / 3 = 1299.6666666667 (the remainder is 2, so 3 is not a divisor of 3899)
  • ...
  • 3899 / 3898 = 1.0002565418163 (the remainder is 1, so 3898 is not a divisor of 3899)
  • 3899 / 3899 = 1 (the remainder is 0, so 3899 is a divisor of 3899)

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 3899 (i.e. 62.441973062997). 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 )

  • 3899 / 1 = 3899 (the remainder is 0, so 1 and 3899 are divisors of 3899)
  • 3899 / 2 = 1949.5 (the remainder is 1, so 2 is not a divisor of 3899)
  • 3899 / 3 = 1299.6666666667 (the remainder is 2, so 3 is not a divisor of 3899)
  • ...
  • 3899 / 61 = 63.918032786885 (the remainder is 56, so 61 is not a divisor of 3899)
  • 3899 / 62 = 62.887096774194 (the remainder is 55, so 62 is not a divisor of 3899)