What are the divisors of 3767?

1, 3767

2 odd divisors

1, 3767

How to compute the divisors of 3767?

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

  • 3767 / 1 = 3767 (the remainder is 0, so 1 is a divisor of 3767)
  • 3767 / 2 = 1883.5 (the remainder is 1, so 2 is not a divisor of 3767)
  • 3767 / 3 = 1255.6666666667 (the remainder is 2, so 3 is not a divisor of 3767)
  • ...
  • 3767 / 3766 = 1.0002655337228 (the remainder is 1, so 3766 is not a divisor of 3767)
  • 3767 / 3767 = 1 (the remainder is 0, so 3767 is a divisor of 3767)

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 3767 (i.e. 61.375891032229). 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 )

  • 3767 / 1 = 3767 (the remainder is 0, so 1 and 3767 are divisors of 3767)
  • 3767 / 2 = 1883.5 (the remainder is 1, so 2 is not a divisor of 3767)
  • 3767 / 3 = 1255.6666666667 (the remainder is 2, so 3 is not a divisor of 3767)
  • ...
  • 3767 / 60 = 62.783333333333 (the remainder is 47, so 60 is not a divisor of 3767)
  • 3767 / 61 = 61.754098360656 (the remainder is 46, so 61 is not a divisor of 3767)