What are the divisors of 4795?

1, 5, 7, 35, 137, 685, 959, 4795

8 odd divisors

1, 5, 7, 35, 137, 685, 959, 4795

How to compute the divisors of 4795?

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

  • 4795 / 1 = 4795 (the remainder is 0, so 1 is a divisor of 4795)
  • 4795 / 2 = 2397.5 (the remainder is 1, so 2 is not a divisor of 4795)
  • 4795 / 3 = 1598.3333333333 (the remainder is 1, so 3 is not a divisor of 4795)
  • ...
  • 4795 / 4794 = 1.0002085940759 (the remainder is 1, so 4794 is not a divisor of 4795)
  • 4795 / 4795 = 1 (the remainder is 0, so 4795 is a divisor of 4795)

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 4795 (i.e. 69.245938509056). 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 )

  • 4795 / 1 = 4795 (the remainder is 0, so 1 and 4795 are divisors of 4795)
  • 4795 / 2 = 2397.5 (the remainder is 1, so 2 is not a divisor of 4795)
  • 4795 / 3 = 1598.3333333333 (the remainder is 1, so 3 is not a divisor of 4795)
  • ...
  • 4795 / 68 = 70.514705882353 (the remainder is 35, so 68 is not a divisor of 4795)
  • 4795 / 69 = 69.492753623188 (the remainder is 34, so 69 is not a divisor of 4795)