What are the divisors of 437?

1, 19, 23, 437

4 odd divisors

1, 19, 23, 437

How to compute the divisors of 437?

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

  • 437 / 1 = 437 (the remainder is 0, so 1 is a divisor of 437)
  • 437 / 2 = 218.5 (the remainder is 1, so 2 is not a divisor of 437)
  • 437 / 3 = 145.66666666667 (the remainder is 2, so 3 is not a divisor of 437)
  • ...
  • 437 / 436 = 1.0022935779817 (the remainder is 1, so 436 is not a divisor of 437)
  • 437 / 437 = 1 (the remainder is 0, so 437 is a divisor of 437)

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 437 (i.e. 20.904544960367). 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 )

  • 437 / 1 = 437 (the remainder is 0, so 1 and 437 are divisors of 437)
  • 437 / 2 = 218.5 (the remainder is 1, so 2 is not a divisor of 437)
  • 437 / 3 = 145.66666666667 (the remainder is 2, so 3 is not a divisor of 437)
  • ...
  • 437 / 19 = 23 (the remainder is 0, so 19 and 23 are divisors of 437)
  • 437 / 20 = 21.85 (the remainder is 17, so 20 is not a divisor of 437)