What are the divisors of 2857?

1, 2857

2 odd divisors

1, 2857

How to compute the divisors of 2857?

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

  • 2857 / 1 = 2857 (the remainder is 0, so 1 is a divisor of 2857)
  • 2857 / 2 = 1428.5 (the remainder is 1, so 2 is not a divisor of 2857)
  • 2857 / 3 = 952.33333333333 (the remainder is 1, so 3 is not a divisor of 2857)
  • ...
  • 2857 / 2856 = 1.000350140056 (the remainder is 1, so 2856 is not a divisor of 2857)
  • 2857 / 2857 = 1 (the remainder is 0, so 2857 is a divisor of 2857)

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 2857 (i.e. 53.450912059571). 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 )

  • 2857 / 1 = 2857 (the remainder is 0, so 1 and 2857 are divisors of 2857)
  • 2857 / 2 = 1428.5 (the remainder is 1, so 2 is not a divisor of 2857)
  • 2857 / 3 = 952.33333333333 (the remainder is 1, so 3 is not a divisor of 2857)
  • ...
  • 2857 / 52 = 54.942307692308 (the remainder is 49, so 52 is not a divisor of 2857)
  • 2857 / 53 = 53.905660377358 (the remainder is 48, so 53 is not a divisor of 2857)