What are the divisors of 709?

1, 709

2 odd divisors

1, 709

How to compute the divisors of 709?

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

  • 709 / 1 = 709 (the remainder is 0, so 1 is a divisor of 709)
  • 709 / 2 = 354.5 (the remainder is 1, so 2 is not a divisor of 709)
  • 709 / 3 = 236.33333333333 (the remainder is 1, so 3 is not a divisor of 709)
  • ...
  • 709 / 708 = 1.0014124293785 (the remainder is 1, so 708 is not a divisor of 709)
  • 709 / 709 = 1 (the remainder is 0, so 709 is a divisor of 709)

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 709 (i.e. 26.627053911389). 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 )

  • 709 / 1 = 709 (the remainder is 0, so 1 and 709 are divisors of 709)
  • 709 / 2 = 354.5 (the remainder is 1, so 2 is not a divisor of 709)
  • 709 / 3 = 236.33333333333 (the remainder is 1, so 3 is not a divisor of 709)
  • ...
  • 709 / 25 = 28.36 (the remainder is 9, so 25 is not a divisor of 709)
  • 709 / 26 = 27.269230769231 (the remainder is 7, so 26 is not a divisor of 709)