What are the divisors of 3747?

1, 3, 1249, 3747

4 odd divisors

1, 3, 1249, 3747

How to compute the divisors of 3747?

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

  • 3747 / 1 = 3747 (the remainder is 0, so 1 is a divisor of 3747)
  • 3747 / 2 = 1873.5 (the remainder is 1, so 2 is not a divisor of 3747)
  • 3747 / 3 = 1249 (the remainder is 0, so 3 is a divisor of 3747)
  • ...
  • 3747 / 3746 = 1.0002669514148 (the remainder is 1, so 3746 is not a divisor of 3747)
  • 3747 / 3747 = 1 (the remainder is 0, so 3747 is a divisor of 3747)

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 3747 (i.e. 61.212743771212). 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 )

  • 3747 / 1 = 3747 (the remainder is 0, so 1 and 3747 are divisors of 3747)
  • 3747 / 2 = 1873.5 (the remainder is 1, so 2 is not a divisor of 3747)
  • 3747 / 3 = 1249 (the remainder is 0, so 3 and 1249 are divisors of 3747)
  • ...
  • 3747 / 60 = 62.45 (the remainder is 27, so 60 is not a divisor of 3747)
  • 3747 / 61 = 61.426229508197 (the remainder is 26, so 61 is not a divisor of 3747)