What are the divisors of 3389?

1, 3389

2 odd divisors

1, 3389

How to compute the divisors of 3389?

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

  • 3389 / 1 = 3389 (the remainder is 0, so 1 is a divisor of 3389)
  • 3389 / 2 = 1694.5 (the remainder is 1, so 2 is not a divisor of 3389)
  • 3389 / 3 = 1129.6666666667 (the remainder is 2, so 3 is not a divisor of 3389)
  • ...
  • 3389 / 3388 = 1.0002951593861 (the remainder is 1, so 3388 is not a divisor of 3389)
  • 3389 / 3389 = 1 (the remainder is 0, so 3389 is a divisor of 3389)

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 3389 (i.e. 58.215118311312). 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 )

  • 3389 / 1 = 3389 (the remainder is 0, so 1 and 3389 are divisors of 3389)
  • 3389 / 2 = 1694.5 (the remainder is 1, so 2 is not a divisor of 3389)
  • 3389 / 3 = 1129.6666666667 (the remainder is 2, so 3 is not a divisor of 3389)
  • ...
  • 3389 / 57 = 59.456140350877 (the remainder is 26, so 57 is not a divisor of 3389)
  • 3389 / 58 = 58.431034482759 (the remainder is 25, so 58 is not a divisor of 3389)