What are the divisors of 943?

1, 23, 41, 943

4 odd divisors

1, 23, 41, 943

How to compute the divisors of 943?

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

  • 943 / 1 = 943 (the remainder is 0, so 1 is a divisor of 943)
  • 943 / 2 = 471.5 (the remainder is 1, so 2 is not a divisor of 943)
  • 943 / 3 = 314.33333333333 (the remainder is 1, so 3 is not a divisor of 943)
  • ...
  • 943 / 942 = 1.0010615711253 (the remainder is 1, so 942 is not a divisor of 943)
  • 943 / 943 = 1 (the remainder is 0, so 943 is a divisor of 943)

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 943 (i.e. 30.708305065568). 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 )

  • 943 / 1 = 943 (the remainder is 0, so 1 and 943 are divisors of 943)
  • 943 / 2 = 471.5 (the remainder is 1, so 2 is not a divisor of 943)
  • 943 / 3 = 314.33333333333 (the remainder is 1, so 3 is not a divisor of 943)
  • ...
  • 943 / 29 = 32.51724137931 (the remainder is 15, so 29 is not a divisor of 943)
  • 943 / 30 = 31.433333333333 (the remainder is 13, so 30 is not a divisor of 943)