What are the divisors of 1047?

1, 3, 349, 1047

4 odd divisors

1, 3, 349, 1047

How to compute the divisors of 1047?

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

  • 1047 / 1 = 1047 (the remainder is 0, so 1 is a divisor of 1047)
  • 1047 / 2 = 523.5 (the remainder is 1, so 2 is not a divisor of 1047)
  • 1047 / 3 = 349 (the remainder is 0, so 3 is a divisor of 1047)
  • ...
  • 1047 / 1046 = 1.0009560229446 (the remainder is 1, so 1046 is not a divisor of 1047)
  • 1047 / 1047 = 1 (the remainder is 0, so 1047 is a divisor of 1047)

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 1047 (i.e. 32.357379374727). 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 )

  • 1047 / 1 = 1047 (the remainder is 0, so 1 and 1047 are divisors of 1047)
  • 1047 / 2 = 523.5 (the remainder is 1, so 2 is not a divisor of 1047)
  • 1047 / 3 = 349 (the remainder is 0, so 3 and 349 are divisors of 1047)
  • ...
  • 1047 / 31 = 33.774193548387 (the remainder is 24, so 31 is not a divisor of 1047)
  • 1047 / 32 = 32.71875 (the remainder is 23, so 32 is not a divisor of 1047)