What are the divisors of 703?

1, 19, 37, 703

4 odd divisors

1, 19, 37, 703

How to compute the divisors of 703?

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

  • 703 / 1 = 703 (the remainder is 0, so 1 is a divisor of 703)
  • 703 / 2 = 351.5 (the remainder is 1, so 2 is not a divisor of 703)
  • 703 / 3 = 234.33333333333 (the remainder is 1, so 3 is not a divisor of 703)
  • ...
  • 703 / 702 = 1.0014245014245 (the remainder is 1, so 702 is not a divisor of 703)
  • 703 / 703 = 1 (the remainder is 0, so 703 is a divisor of 703)

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 703 (i.e. 26.514147167126). 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 )

  • 703 / 1 = 703 (the remainder is 0, so 1 and 703 are divisors of 703)
  • 703 / 2 = 351.5 (the remainder is 1, so 2 is not a divisor of 703)
  • 703 / 3 = 234.33333333333 (the remainder is 1, so 3 is not a divisor of 703)
  • ...
  • 703 / 25 = 28.12 (the remainder is 3, so 25 is not a divisor of 703)
  • 703 / 26 = 27.038461538462 (the remainder is 1, so 26 is not a divisor of 703)