What are the divisors of 4931?

1, 4931

2 odd divisors

1, 4931

How to compute the divisors of 4931?

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

  • 4931 / 1 = 4931 (the remainder is 0, so 1 is a divisor of 4931)
  • 4931 / 2 = 2465.5 (the remainder is 1, so 2 is not a divisor of 4931)
  • 4931 / 3 = 1643.6666666667 (the remainder is 2, so 3 is not a divisor of 4931)
  • ...
  • 4931 / 4930 = 1.0002028397566 (the remainder is 1, so 4930 is not a divisor of 4931)
  • 4931 / 4931 = 1 (the remainder is 0, so 4931 is a divisor of 4931)

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 4931 (i.e. 70.221079456243). 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 )

  • 4931 / 1 = 4931 (the remainder is 0, so 1 and 4931 are divisors of 4931)
  • 4931 / 2 = 2465.5 (the remainder is 1, so 2 is not a divisor of 4931)
  • 4931 / 3 = 1643.6666666667 (the remainder is 2, so 3 is not a divisor of 4931)
  • ...
  • 4931 / 69 = 71.463768115942 (the remainder is 32, so 69 is not a divisor of 4931)
  • 4931 / 70 = 70.442857142857 (the remainder is 31, so 70 is not a divisor of 4931)