What are the divisors of 1847?

1, 1847

2 odd divisors

1, 1847

How to compute the divisors of 1847?

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

  • 1847 / 1 = 1847 (the remainder is 0, so 1 is a divisor of 1847)
  • 1847 / 2 = 923.5 (the remainder is 1, so 2 is not a divisor of 1847)
  • 1847 / 3 = 615.66666666667 (the remainder is 2, so 3 is not a divisor of 1847)
  • ...
  • 1847 / 1846 = 1.0005417118093 (the remainder is 1, so 1846 is not a divisor of 1847)
  • 1847 / 1847 = 1 (the remainder is 0, so 1847 is a divisor of 1847)

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 1847 (i.e. 42.976737893889). 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 )

  • 1847 / 1 = 1847 (the remainder is 0, so 1 and 1847 are divisors of 1847)
  • 1847 / 2 = 923.5 (the remainder is 1, so 2 is not a divisor of 1847)
  • 1847 / 3 = 615.66666666667 (the remainder is 2, so 3 is not a divisor of 1847)
  • ...
  • 1847 / 41 = 45.048780487805 (the remainder is 2, so 41 is not a divisor of 1847)
  • 1847 / 42 = 43.97619047619 (the remainder is 41, so 42 is not a divisor of 1847)