What are the divisors of 2549?

1, 2549

2 odd divisors

1, 2549

How to compute the divisors of 2549?

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

  • 2549 / 1 = 2549 (the remainder is 0, so 1 is a divisor of 2549)
  • 2549 / 2 = 1274.5 (the remainder is 1, so 2 is not a divisor of 2549)
  • 2549 / 3 = 849.66666666667 (the remainder is 2, so 3 is not a divisor of 2549)
  • ...
  • 2549 / 2548 = 1.0003924646782 (the remainder is 1, so 2548 is not a divisor of 2549)
  • 2549 / 2549 = 1 (the remainder is 0, so 2549 is a divisor of 2549)

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 2549 (i.e. 50.487622245457). 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 )

  • 2549 / 1 = 2549 (the remainder is 0, so 1 and 2549 are divisors of 2549)
  • 2549 / 2 = 1274.5 (the remainder is 1, so 2 is not a divisor of 2549)
  • 2549 / 3 = 849.66666666667 (the remainder is 2, so 3 is not a divisor of 2549)
  • ...
  • 2549 / 49 = 52.020408163265 (the remainder is 1, so 49 is not a divisor of 2549)
  • 2549 / 50 = 50.98 (the remainder is 49, so 50 is not a divisor of 2549)