What are the divisors of 2086?

1, 2, 7, 14, 149, 298, 1043, 2086

4 even divisors

2, 14, 298, 2086

4 odd divisors

1, 7, 149, 1043

How to compute the divisors of 2086?

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

  • 2086 / 1 = 2086 (the remainder is 0, so 1 is a divisor of 2086)
  • 2086 / 2 = 1043 (the remainder is 0, so 2 is a divisor of 2086)
  • 2086 / 3 = 695.33333333333 (the remainder is 1, so 3 is not a divisor of 2086)
  • ...
  • 2086 / 2085 = 1.000479616307 (the remainder is 1, so 2085 is not a divisor of 2086)
  • 2086 / 2086 = 1 (the remainder is 0, so 2086 is a divisor of 2086)

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 2086 (i.e. 45.672748986677). 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 )

  • 2086 / 1 = 2086 (the remainder is 0, so 1 and 2086 are divisors of 2086)
  • 2086 / 2 = 1043 (the remainder is 0, so 2 and 1043 are divisors of 2086)
  • 2086 / 3 = 695.33333333333 (the remainder is 1, so 3 is not a divisor of 2086)
  • ...
  • 2086 / 44 = 47.409090909091 (the remainder is 18, so 44 is not a divisor of 2086)
  • 2086 / 45 = 46.355555555556 (the remainder is 16, so 45 is not a divisor of 2086)