What are the divisors of 4703?

1, 4703

2 odd divisors

1, 4703

How to compute the divisors of 4703?

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

  • 4703 / 1 = 4703 (the remainder is 0, so 1 is a divisor of 4703)
  • 4703 / 2 = 2351.5 (the remainder is 1, so 2 is not a divisor of 4703)
  • 4703 / 3 = 1567.6666666667 (the remainder is 2, so 3 is not a divisor of 4703)
  • ...
  • 4703 / 4702 = 1.0002126754573 (the remainder is 1, so 4702 is not a divisor of 4703)
  • 4703 / 4703 = 1 (the remainder is 0, so 4703 is a divisor of 4703)

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 4703 (i.e. 68.5784222624). 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 )

  • 4703 / 1 = 4703 (the remainder is 0, so 1 and 4703 are divisors of 4703)
  • 4703 / 2 = 2351.5 (the remainder is 1, so 2 is not a divisor of 4703)
  • 4703 / 3 = 1567.6666666667 (the remainder is 2, so 3 is not a divisor of 4703)
  • ...
  • 4703 / 67 = 70.194029850746 (the remainder is 13, so 67 is not a divisor of 4703)
  • 4703 / 68 = 69.161764705882 (the remainder is 11, so 68 is not a divisor of 4703)