What are the divisors of 2683?

1, 2683

2 odd divisors

1, 2683

How to compute the divisors of 2683?

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

  • 2683 / 1 = 2683 (the remainder is 0, so 1 is a divisor of 2683)
  • 2683 / 2 = 1341.5 (the remainder is 1, so 2 is not a divisor of 2683)
  • 2683 / 3 = 894.33333333333 (the remainder is 1, so 3 is not a divisor of 2683)
  • ...
  • 2683 / 2682 = 1.0003728560776 (the remainder is 1, so 2682 is not a divisor of 2683)
  • 2683 / 2683 = 1 (the remainder is 0, so 2683 is a divisor of 2683)

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 2683 (i.e. 51.797683345879). 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 )

  • 2683 / 1 = 2683 (the remainder is 0, so 1 and 2683 are divisors of 2683)
  • 2683 / 2 = 1341.5 (the remainder is 1, so 2 is not a divisor of 2683)
  • 2683 / 3 = 894.33333333333 (the remainder is 1, so 3 is not a divisor of 2683)
  • ...
  • 2683 / 50 = 53.66 (the remainder is 33, so 50 is not a divisor of 2683)
  • 2683 / 51 = 52.607843137255 (the remainder is 31, so 51 is not a divisor of 2683)