What are the divisors of 3625?

1, 5, 25, 29, 125, 145, 725, 3625

8 odd divisors

1, 5, 25, 29, 125, 145, 725, 3625

How to compute the divisors of 3625?

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

  • 3625 / 1 = 3625 (the remainder is 0, so 1 is a divisor of 3625)
  • 3625 / 2 = 1812.5 (the remainder is 1, so 2 is not a divisor of 3625)
  • 3625 / 3 = 1208.3333333333 (the remainder is 1, so 3 is not a divisor of 3625)
  • ...
  • 3625 / 3624 = 1.0002759381898 (the remainder is 1, so 3624 is not a divisor of 3625)
  • 3625 / 3625 = 1 (the remainder is 0, so 3625 is a divisor of 3625)

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 3625 (i.e. 60.207972893961). 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 )

  • 3625 / 1 = 3625 (the remainder is 0, so 1 and 3625 are divisors of 3625)
  • 3625 / 2 = 1812.5 (the remainder is 1, so 2 is not a divisor of 3625)
  • 3625 / 3 = 1208.3333333333 (the remainder is 1, so 3 is not a divisor of 3625)
  • ...
  • 3625 / 59 = 61.440677966102 (the remainder is 26, so 59 is not a divisor of 3625)
  • 3625 / 60 = 60.416666666667 (the remainder is 25, so 60 is not a divisor of 3625)