What are the divisors of 2897?

1, 2897

2 odd divisors

1, 2897

How to compute the divisors of 2897?

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

  • 2897 / 1 = 2897 (the remainder is 0, so 1 is a divisor of 2897)
  • 2897 / 2 = 1448.5 (the remainder is 1, so 2 is not a divisor of 2897)
  • 2897 / 3 = 965.66666666667 (the remainder is 2, so 3 is not a divisor of 2897)
  • ...
  • 2897 / 2896 = 1.0003453038674 (the remainder is 1, so 2896 is not a divisor of 2897)
  • 2897 / 2897 = 1 (the remainder is 0, so 2897 is a divisor of 2897)

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 2897 (i.e. 53.823786563192). 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 )

  • 2897 / 1 = 2897 (the remainder is 0, so 1 and 2897 are divisors of 2897)
  • 2897 / 2 = 1448.5 (the remainder is 1, so 2 is not a divisor of 2897)
  • 2897 / 3 = 965.66666666667 (the remainder is 2, so 3 is not a divisor of 2897)
  • ...
  • 2897 / 52 = 55.711538461538 (the remainder is 37, so 52 is not a divisor of 2897)
  • 2897 / 53 = 54.660377358491 (the remainder is 35, so 53 is not a divisor of 2897)