What are the divisors of 9215?

1, 5, 19, 95, 97, 485, 1843, 9215

8 odd divisors

1, 5, 19, 95, 97, 485, 1843, 9215

How to compute the divisors of 9215?

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

  • 9215 / 1 = 9215 (the remainder is 0, so 1 is a divisor of 9215)
  • 9215 / 2 = 4607.5 (the remainder is 1, so 2 is not a divisor of 9215)
  • 9215 / 3 = 3071.6666666667 (the remainder is 2, so 3 is not a divisor of 9215)
  • ...
  • 9215 / 9214 = 1.0001085304971 (the remainder is 1, so 9214 is not a divisor of 9215)
  • 9215 / 9215 = 1 (the remainder is 0, so 9215 is a divisor of 9215)

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 9215 (i.e. 95.994791525374). 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 )

  • 9215 / 1 = 9215 (the remainder is 0, so 1 and 9215 are divisors of 9215)
  • 9215 / 2 = 4607.5 (the remainder is 1, so 2 is not a divisor of 9215)
  • 9215 / 3 = 3071.6666666667 (the remainder is 2, so 3 is not a divisor of 9215)
  • ...
  • 9215 / 94 = 98.031914893617 (the remainder is 3, so 94 is not a divisor of 9215)
  • 9215 / 95 = 97 (the remainder is 0, so 95 and 97 are divisors of 9215)