What are the divisors of 9095?

1, 5, 17, 85, 107, 535, 1819, 9095

8 odd divisors

1, 5, 17, 85, 107, 535, 1819, 9095

How to compute the divisors of 9095?

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

  • 9095 / 1 = 9095 (the remainder is 0, so 1 is a divisor of 9095)
  • 9095 / 2 = 4547.5 (the remainder is 1, so 2 is not a divisor of 9095)
  • 9095 / 3 = 3031.6666666667 (the remainder is 2, so 3 is not a divisor of 9095)
  • ...
  • 9095 / 9094 = 1.0001099626127 (the remainder is 1, so 9094 is not a divisor of 9095)
  • 9095 / 9095 = 1 (the remainder is 0, so 9095 is a divisor of 9095)

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 9095 (i.e. 95.367709419908). 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 )

  • 9095 / 1 = 9095 (the remainder is 0, so 1 and 9095 are divisors of 9095)
  • 9095 / 2 = 4547.5 (the remainder is 1, so 2 is not a divisor of 9095)
  • 9095 / 3 = 3031.6666666667 (the remainder is 2, so 3 is not a divisor of 9095)
  • ...
  • 9095 / 94 = 96.755319148936 (the remainder is 71, so 94 is not a divisor of 9095)
  • 9095 / 95 = 95.736842105263 (the remainder is 70, so 95 is not a divisor of 9095)