What are the divisors of 215?

1, 5, 43, 215

4 odd divisors

1, 5, 43, 215

How to compute the divisors of 215?

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

  • 215 / 1 = 215 (the remainder is 0, so 1 is a divisor of 215)
  • 215 / 2 = 107.5 (the remainder is 1, so 2 is not a divisor of 215)
  • 215 / 3 = 71.666666666667 (the remainder is 2, so 3 is not a divisor of 215)
  • ...
  • 215 / 214 = 1.0046728971963 (the remainder is 1, so 214 is not a divisor of 215)
  • 215 / 215 = 1 (the remainder is 0, so 215 is a divisor of 215)

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 215 (i.e. 14.662878298615). 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 )

  • 215 / 1 = 215 (the remainder is 0, so 1 and 215 are divisors of 215)
  • 215 / 2 = 107.5 (the remainder is 1, so 2 is not a divisor of 215)
  • 215 / 3 = 71.666666666667 (the remainder is 2, so 3 is not a divisor of 215)
  • ...
  • 215 / 13 = 16.538461538462 (the remainder is 7, so 13 is not a divisor of 215)
  • 215 / 14 = 15.357142857143 (the remainder is 5, so 14 is not a divisor of 215)