What are the divisors of 3905?

1, 5, 11, 55, 71, 355, 781, 3905

8 odd divisors

1, 5, 11, 55, 71, 355, 781, 3905

How to compute the divisors of 3905?

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

  • 3905 / 1 = 3905 (the remainder is 0, so 1 is a divisor of 3905)
  • 3905 / 2 = 1952.5 (the remainder is 1, so 2 is not a divisor of 3905)
  • 3905 / 3 = 1301.6666666667 (the remainder is 2, so 3 is not a divisor of 3905)
  • ...
  • 3905 / 3904 = 1.000256147541 (the remainder is 1, so 3904 is not a divisor of 3905)
  • 3905 / 3905 = 1 (the remainder is 0, so 3905 is a divisor of 3905)

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 3905 (i.e. 62.489999199872). 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 )

  • 3905 / 1 = 3905 (the remainder is 0, so 1 and 3905 are divisors of 3905)
  • 3905 / 2 = 1952.5 (the remainder is 1, so 2 is not a divisor of 3905)
  • 3905 / 3 = 1301.6666666667 (the remainder is 2, so 3 is not a divisor of 3905)
  • ...
  • 3905 / 61 = 64.016393442623 (the remainder is 1, so 61 is not a divisor of 3905)
  • 3905 / 62 = 62.983870967742 (the remainder is 61, so 62 is not a divisor of 3905)