What are the divisors of 4310?

1, 2, 5, 10, 431, 862, 2155, 4310

4 even divisors

2, 10, 862, 4310

4 odd divisors

1, 5, 431, 2155

How to compute the divisors of 4310?

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

  • 4310 / 1 = 4310 (the remainder is 0, so 1 is a divisor of 4310)
  • 4310 / 2 = 2155 (the remainder is 0, so 2 is a divisor of 4310)
  • 4310 / 3 = 1436.6666666667 (the remainder is 2, so 3 is not a divisor of 4310)
  • ...
  • 4310 / 4309 = 1.0002320724066 (the remainder is 1, so 4309 is not a divisor of 4310)
  • 4310 / 4310 = 1 (the remainder is 0, so 4310 is a divisor of 4310)

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 4310 (i.e. 65.650590248679). 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 )

  • 4310 / 1 = 4310 (the remainder is 0, so 1 and 4310 are divisors of 4310)
  • 4310 / 2 = 2155 (the remainder is 0, so 2 and 2155 are divisors of 4310)
  • 4310 / 3 = 1436.6666666667 (the remainder is 2, so 3 is not a divisor of 4310)
  • ...
  • 4310 / 64 = 67.34375 (the remainder is 22, so 64 is not a divisor of 4310)
  • 4310 / 65 = 66.307692307692 (the remainder is 20, so 65 is not a divisor of 4310)