What are the divisors of 3293?

1, 37, 89, 3293

There is a total of 4 positive divisors.
The sum of these divisors is 3420.
The arithmetic mean is 855.

4 odd divisors

1, 37, 89, 3293

How to compute the divisors of 3293?

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 3293 by each of the numbers from 1 to 3293 to determine which ones have a remainder equal to 0.

$Remainder = N - (M \times ⌊ \frac{N}{M} ⌋)$

(where $⌊ \frac{N}{M} ⌋$ is the integer part of the quotient)

3293 / 1 = 3293 (the remainder is 0, so 1 is a divisor of 3293)
3293 / 2 = 1646.5 (the remainder is 1, so 2 is not a divisor of 3293)
3293 / 3 = 1097.6666666667 (the remainder is 2, so 3 is not a divisor of 3293)
...
3293 / 3292 = 1.0003037667072 (the remainder is 1, so 3292 is not a divisor of 3293)
3293 / 3293 = 1 (the remainder is 0, so 3293 is a divisor of 3293)

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 3293 (i.e. 57.384666941614). 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 \times d = N$

(thus, if $\frac{N}{D} = d$ , then $\frac{N}{d} = D$ )

3293 / 1 = 3293 (the remainder is 0, so 1 and 3293 are divisors of 3293)
3293 / 2 = 1646.5 (the remainder is 1, so 2 is not a divisor of 3293)
3293 / 3 = 1097.6666666667 (the remainder is 2, so 3 is not a divisor of 3293)
...
3293 / 56 = 58.803571428571 (the remainder is 45, so 56 is not a divisor of 3293)
3293 / 57 = 57.771929824561 (the remainder is 44, so 57 is not a divisor of 3293)