What are the divisors of 9203?

1, 9203

2 odd divisors

1, 9203

How to compute the divisors of 9203?

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

  • 9203 / 1 = 9203 (the remainder is 0, so 1 is a divisor of 9203)
  • 9203 / 2 = 4601.5 (the remainder is 1, so 2 is not a divisor of 9203)
  • 9203 / 3 = 3067.6666666667 (the remainder is 2, so 3 is not a divisor of 9203)
  • ...
  • 9203 / 9202 = 1.0001086720278 (the remainder is 1, so 9202 is not a divisor of 9203)
  • 9203 / 9203 = 1 (the remainder is 0, so 9203 is a divisor of 9203)

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 9203 (i.e. 95.932267772632). 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 )

  • 9203 / 1 = 9203 (the remainder is 0, so 1 and 9203 are divisors of 9203)
  • 9203 / 2 = 4601.5 (the remainder is 1, so 2 is not a divisor of 9203)
  • 9203 / 3 = 3067.6666666667 (the remainder is 2, so 3 is not a divisor of 9203)
  • ...
  • 9203 / 94 = 97.904255319149 (the remainder is 85, so 94 is not a divisor of 9203)
  • 9203 / 95 = 96.873684210526 (the remainder is 83, so 95 is not a divisor of 9203)