What are the divisors of 4883?

1, 19, 257, 4883

4 odd divisors

1, 19, 257, 4883

How to compute the divisors of 4883?

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

  • 4883 / 1 = 4883 (the remainder is 0, so 1 is a divisor of 4883)
  • 4883 / 2 = 2441.5 (the remainder is 1, so 2 is not a divisor of 4883)
  • 4883 / 3 = 1627.6666666667 (the remainder is 2, so 3 is not a divisor of 4883)
  • ...
  • 4883 / 4882 = 1.0002048340844 (the remainder is 1, so 4882 is not a divisor of 4883)
  • 4883 / 4883 = 1 (the remainder is 0, so 4883 is a divisor of 4883)

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 4883 (i.e. 69.878465924775). 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 )

  • 4883 / 1 = 4883 (the remainder is 0, so 1 and 4883 are divisors of 4883)
  • 4883 / 2 = 2441.5 (the remainder is 1, so 2 is not a divisor of 4883)
  • 4883 / 3 = 1627.6666666667 (the remainder is 2, so 3 is not a divisor of 4883)
  • ...
  • 4883 / 68 = 71.808823529412 (the remainder is 55, so 68 is not a divisor of 4883)
  • 4883 / 69 = 70.768115942029 (the remainder is 53, so 69 is not a divisor of 4883)