What are the divisors of 2875?

1, 5, 23, 25, 115, 125, 575, 2875

8 odd divisors

1, 5, 23, 25, 115, 125, 575, 2875

How to compute the divisors of 2875?

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

  • 2875 / 1 = 2875 (the remainder is 0, so 1 is a divisor of 2875)
  • 2875 / 2 = 1437.5 (the remainder is 1, so 2 is not a divisor of 2875)
  • 2875 / 3 = 958.33333333333 (the remainder is 1, so 3 is not a divisor of 2875)
  • ...
  • 2875 / 2874 = 1.000347947112 (the remainder is 1, so 2874 is not a divisor of 2875)
  • 2875 / 2875 = 1 (the remainder is 0, so 2875 is a divisor of 2875)

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 2875 (i.e. 53.619026473818). 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 )

  • 2875 / 1 = 2875 (the remainder is 0, so 1 and 2875 are divisors of 2875)
  • 2875 / 2 = 1437.5 (the remainder is 1, so 2 is not a divisor of 2875)
  • 2875 / 3 = 958.33333333333 (the remainder is 1, so 3 is not a divisor of 2875)
  • ...
  • 2875 / 52 = 55.288461538462 (the remainder is 15, so 52 is not a divisor of 2875)
  • 2875 / 53 = 54.245283018868 (the remainder is 13, so 53 is not a divisor of 2875)