What are the divisors of 2390?

1, 2, 5, 10, 239, 478, 1195, 2390

4 even divisors

2, 10, 478, 2390

4 odd divisors

1, 5, 239, 1195

How to compute the divisors of 2390?

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

  • 2390 / 1 = 2390 (the remainder is 0, so 1 is a divisor of 2390)
  • 2390 / 2 = 1195 (the remainder is 0, so 2 is a divisor of 2390)
  • 2390 / 3 = 796.66666666667 (the remainder is 2, so 3 is not a divisor of 2390)
  • ...
  • 2390 / 2389 = 1.0004185851821 (the remainder is 1, so 2389 is not a divisor of 2390)
  • 2390 / 2390 = 1 (the remainder is 0, so 2390 is a divisor of 2390)

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 2390 (i.e. 48.887626246321). 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 )

  • 2390 / 1 = 2390 (the remainder is 0, so 1 and 2390 are divisors of 2390)
  • 2390 / 2 = 1195 (the remainder is 0, so 2 and 1195 are divisors of 2390)
  • 2390 / 3 = 796.66666666667 (the remainder is 2, so 3 is not a divisor of 2390)
  • ...
  • 2390 / 47 = 50.851063829787 (the remainder is 40, so 47 is not a divisor of 2390)
  • 2390 / 48 = 49.791666666667 (the remainder is 38, so 48 is not a divisor of 2390)