What are the divisors of 1757?

1, 7, 251, 1757

4 odd divisors

1, 7, 251, 1757

How to compute the divisors of 1757?

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

  • 1757 / 1 = 1757 (the remainder is 0, so 1 is a divisor of 1757)
  • 1757 / 2 = 878.5 (the remainder is 1, so 2 is not a divisor of 1757)
  • 1757 / 3 = 585.66666666667 (the remainder is 2, so 3 is not a divisor of 1757)
  • ...
  • 1757 / 1756 = 1.000569476082 (the remainder is 1, so 1756 is not a divisor of 1757)
  • 1757 / 1757 = 1 (the remainder is 0, so 1757 is a divisor of 1757)

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 1757 (i.e. 41.916583830269). 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 )

  • 1757 / 1 = 1757 (the remainder is 0, so 1 and 1757 are divisors of 1757)
  • 1757 / 2 = 878.5 (the remainder is 1, so 2 is not a divisor of 1757)
  • 1757 / 3 = 585.66666666667 (the remainder is 2, so 3 is not a divisor of 1757)
  • ...
  • 1757 / 40 = 43.925 (the remainder is 37, so 40 is not a divisor of 1757)
  • 1757 / 41 = 42.853658536585 (the remainder is 35, so 41 is not a divisor of 1757)