What are the divisors of 8179?

1, 8179

2 odd divisors

1, 8179

How to compute the divisors of 8179?

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

  • 8179 / 1 = 8179 (the remainder is 0, so 1 is a divisor of 8179)
  • 8179 / 2 = 4089.5 (the remainder is 1, so 2 is not a divisor of 8179)
  • 8179 / 3 = 2726.3333333333 (the remainder is 1, so 3 is not a divisor of 8179)
  • ...
  • 8179 / 8178 = 1.0001222792859 (the remainder is 1, so 8178 is not a divisor of 8179)
  • 8179 / 8179 = 1 (the remainder is 0, so 8179 is a divisor of 8179)

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 8179 (i.e. 90.437823945515). 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 )

  • 8179 / 1 = 8179 (the remainder is 0, so 1 and 8179 are divisors of 8179)
  • 8179 / 2 = 4089.5 (the remainder is 1, so 2 is not a divisor of 8179)
  • 8179 / 3 = 2726.3333333333 (the remainder is 1, so 3 is not a divisor of 8179)
  • ...
  • 8179 / 89 = 91.898876404494 (the remainder is 80, so 89 is not a divisor of 8179)
  • 8179 / 90 = 90.877777777778 (the remainder is 79, so 90 is not a divisor of 8179)