What are the divisors of 365?

1, 5, 73, 365

4 odd divisors

1, 5, 73, 365

How to compute the divisors of 365?

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

  • 365 / 1 = 365 (the remainder is 0, so 1 is a divisor of 365)
  • 365 / 2 = 182.5 (the remainder is 1, so 2 is not a divisor of 365)
  • 365 / 3 = 121.66666666667 (the remainder is 2, so 3 is not a divisor of 365)
  • ...
  • 365 / 364 = 1.0027472527473 (the remainder is 1, so 364 is not a divisor of 365)
  • 365 / 365 = 1 (the remainder is 0, so 365 is a divisor of 365)

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 365 (i.e. 19.104973174543). 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 )

  • 365 / 1 = 365 (the remainder is 0, so 1 and 365 are divisors of 365)
  • 365 / 2 = 182.5 (the remainder is 1, so 2 is not a divisor of 365)
  • 365 / 3 = 121.66666666667 (the remainder is 2, so 3 is not a divisor of 365)
  • ...
  • 365 / 18 = 20.277777777778 (the remainder is 5, so 18 is not a divisor of 365)
  • 365 / 19 = 19.210526315789 (the remainder is 4, so 19 is not a divisor of 365)