What are the divisors of 3745?

1, 5, 7, 35, 107, 535, 749, 3745

8 odd divisors

1, 5, 7, 35, 107, 535, 749, 3745

How to compute the divisors of 3745?

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

  • 3745 / 1 = 3745 (the remainder is 0, so 1 is a divisor of 3745)
  • 3745 / 2 = 1872.5 (the remainder is 1, so 2 is not a divisor of 3745)
  • 3745 / 3 = 1248.3333333333 (the remainder is 1, so 3 is not a divisor of 3745)
  • ...
  • 3745 / 3744 = 1.0002670940171 (the remainder is 1, so 3744 is not a divisor of 3745)
  • 3745 / 3745 = 1 (the remainder is 0, so 3745 is a divisor of 3745)

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 3745 (i.e. 61.196405123177). 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 )

  • 3745 / 1 = 3745 (the remainder is 0, so 1 and 3745 are divisors of 3745)
  • 3745 / 2 = 1872.5 (the remainder is 1, so 2 is not a divisor of 3745)
  • 3745 / 3 = 1248.3333333333 (the remainder is 1, so 3 is not a divisor of 3745)
  • ...
  • 3745 / 60 = 62.416666666667 (the remainder is 25, so 60 is not a divisor of 3745)
  • 3745 / 61 = 61.393442622951 (the remainder is 24, so 61 is not a divisor of 3745)