What are the divisors of 9082?

1, 2, 19, 38, 239, 478, 4541, 9082

4 even divisors

2, 38, 478, 9082

4 odd divisors

1, 19, 239, 4541

How to compute the divisors of 9082?

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

  • 9082 / 1 = 9082 (the remainder is 0, so 1 is a divisor of 9082)
  • 9082 / 2 = 4541 (the remainder is 0, so 2 is a divisor of 9082)
  • 9082 / 3 = 3027.3333333333 (the remainder is 1, so 3 is not a divisor of 9082)
  • ...
  • 9082 / 9081 = 1.0001101200308 (the remainder is 1, so 9081 is not a divisor of 9082)
  • 9082 / 9082 = 1 (the remainder is 0, so 9082 is a divisor of 9082)

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 9082 (i.e. 95.299527805756). 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 )

  • 9082 / 1 = 9082 (the remainder is 0, so 1 and 9082 are divisors of 9082)
  • 9082 / 2 = 4541 (the remainder is 0, so 2 and 4541 are divisors of 9082)
  • 9082 / 3 = 3027.3333333333 (the remainder is 1, so 3 is not a divisor of 9082)
  • ...
  • 9082 / 94 = 96.617021276596 (the remainder is 58, so 94 is not a divisor of 9082)
  • 9082 / 95 = 95.6 (the remainder is 57, so 95 is not a divisor of 9082)