What are the divisors of 3655?

1, 5, 17, 43, 85, 215, 731, 3655

8 odd divisors

1, 5, 17, 43, 85, 215, 731, 3655

How to compute the divisors of 3655?

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

  • 3655 / 1 = 3655 (the remainder is 0, so 1 is a divisor of 3655)
  • 3655 / 2 = 1827.5 (the remainder is 1, so 2 is not a divisor of 3655)
  • 3655 / 3 = 1218.3333333333 (the remainder is 1, so 3 is not a divisor of 3655)
  • ...
  • 3655 / 3654 = 1.0002736726875 (the remainder is 1, so 3654 is not a divisor of 3655)
  • 3655 / 3655 = 1 (the remainder is 0, so 3655 is a divisor of 3655)

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 3655 (i.e. 60.456596000767). 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 )

  • 3655 / 1 = 3655 (the remainder is 0, so 1 and 3655 are divisors of 3655)
  • 3655 / 2 = 1827.5 (the remainder is 1, so 2 is not a divisor of 3655)
  • 3655 / 3 = 1218.3333333333 (the remainder is 1, so 3 is not a divisor of 3655)
  • ...
  • 3655 / 59 = 61.949152542373 (the remainder is 56, so 59 is not a divisor of 3655)
  • 3655 / 60 = 60.916666666667 (the remainder is 55, so 60 is not a divisor of 3655)