What are the divisors of 4823?

1, 7, 13, 53, 91, 371, 689, 4823

8 odd divisors

1, 7, 13, 53, 91, 371, 689, 4823

How to compute the divisors of 4823?

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

  • 4823 / 1 = 4823 (the remainder is 0, so 1 is a divisor of 4823)
  • 4823 / 2 = 2411.5 (the remainder is 1, so 2 is not a divisor of 4823)
  • 4823 / 3 = 1607.6666666667 (the remainder is 2, so 3 is not a divisor of 4823)
  • ...
  • 4823 / 4822 = 1.0002073828287 (the remainder is 1, so 4822 is not a divisor of 4823)
  • 4823 / 4823 = 1 (the remainder is 0, so 4823 is a divisor of 4823)

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 4823 (i.e. 69.447822140079). 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 )

  • 4823 / 1 = 4823 (the remainder is 0, so 1 and 4823 are divisors of 4823)
  • 4823 / 2 = 2411.5 (the remainder is 1, so 2 is not a divisor of 4823)
  • 4823 / 3 = 1607.6666666667 (the remainder is 2, so 3 is not a divisor of 4823)
  • ...
  • 4823 / 68 = 70.926470588235 (the remainder is 63, so 68 is not a divisor of 4823)
  • 4823 / 69 = 69.898550724638 (the remainder is 62, so 69 is not a divisor of 4823)