What are the divisors of 4843?

1, 29, 167, 4843

4 odd divisors

1, 29, 167, 4843

How to compute the divisors of 4843?

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

  • 4843 / 1 = 4843 (the remainder is 0, so 1 is a divisor of 4843)
  • 4843 / 2 = 2421.5 (the remainder is 1, so 2 is not a divisor of 4843)
  • 4843 / 3 = 1614.3333333333 (the remainder is 1, so 3 is not a divisor of 4843)
  • ...
  • 4843 / 4842 = 1.0002065262288 (the remainder is 1, so 4842 is not a divisor of 4843)
  • 4843 / 4843 = 1 (the remainder is 0, so 4843 is a divisor of 4843)

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 4843 (i.e. 69.591666167724). 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 )

  • 4843 / 1 = 4843 (the remainder is 0, so 1 and 4843 are divisors of 4843)
  • 4843 / 2 = 2421.5 (the remainder is 1, so 2 is not a divisor of 4843)
  • 4843 / 3 = 1614.3333333333 (the remainder is 1, so 3 is not a divisor of 4843)
  • ...
  • 4843 / 68 = 71.220588235294 (the remainder is 15, so 68 is not a divisor of 4843)
  • 4843 / 69 = 70.188405797101 (the remainder is 13, so 69 is not a divisor of 4843)