What are the divisors of 4337?

1, 4337

2 odd divisors

1, 4337

How to compute the divisors of 4337?

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

  • 4337 / 1 = 4337 (the remainder is 0, so 1 is a divisor of 4337)
  • 4337 / 2 = 2168.5 (the remainder is 1, so 2 is not a divisor of 4337)
  • 4337 / 3 = 1445.6666666667 (the remainder is 2, so 3 is not a divisor of 4337)
  • ...
  • 4337 / 4336 = 1.0002306273063 (the remainder is 1, so 4336 is not a divisor of 4337)
  • 4337 / 4337 = 1 (the remainder is 0, so 4337 is a divisor of 4337)

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 4337 (i.e. 65.855903304108). 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 )

  • 4337 / 1 = 4337 (the remainder is 0, so 1 and 4337 are divisors of 4337)
  • 4337 / 2 = 2168.5 (the remainder is 1, so 2 is not a divisor of 4337)
  • 4337 / 3 = 1445.6666666667 (the remainder is 2, so 3 is not a divisor of 4337)
  • ...
  • 4337 / 64 = 67.765625 (the remainder is 49, so 64 is not a divisor of 4337)
  • 4337 / 65 = 66.723076923077 (the remainder is 47, so 65 is not a divisor of 4337)