What are the divisors of 607?

1, 607

2 odd divisors

1, 607

How to compute the divisors of 607?

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

  • 607 / 1 = 607 (the remainder is 0, so 1 is a divisor of 607)
  • 607 / 2 = 303.5 (the remainder is 1, so 2 is not a divisor of 607)
  • 607 / 3 = 202.33333333333 (the remainder is 1, so 3 is not a divisor of 607)
  • ...
  • 607 / 606 = 1.0016501650165 (the remainder is 1, so 606 is not a divisor of 607)
  • 607 / 607 = 1 (the remainder is 0, so 607 is a divisor of 607)

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 607 (i.e. 24.63736998951). 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 )

  • 607 / 1 = 607 (the remainder is 0, so 1 and 607 are divisors of 607)
  • 607 / 2 = 303.5 (the remainder is 1, so 2 is not a divisor of 607)
  • 607 / 3 = 202.33333333333 (the remainder is 1, so 3 is not a divisor of 607)
  • ...
  • 607 / 23 = 26.391304347826 (the remainder is 9, so 23 is not a divisor of 607)
  • 607 / 24 = 25.291666666667 (the remainder is 7, so 24 is not a divisor of 607)