What are the divisors of 410?

1, 2, 5, 10, 41, 82, 205, 410

4 even divisors

2, 10, 82, 410

4 odd divisors

1, 5, 41, 205

How to compute the divisors of 410?

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

  • 410 / 1 = 410 (the remainder is 0, so 1 is a divisor of 410)
  • 410 / 2 = 205 (the remainder is 0, so 2 is a divisor of 410)
  • 410 / 3 = 136.66666666667 (the remainder is 2, so 3 is not a divisor of 410)
  • ...
  • 410 / 409 = 1.0024449877751 (the remainder is 1, so 409 is not a divisor of 410)
  • 410 / 410 = 1 (the remainder is 0, so 410 is a divisor of 410)

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 410 (i.e. 20.248456731317). 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 )

  • 410 / 1 = 410 (the remainder is 0, so 1 and 410 are divisors of 410)
  • 410 / 2 = 205 (the remainder is 0, so 2 and 205 are divisors of 410)
  • 410 / 3 = 136.66666666667 (the remainder is 2, so 3 is not a divisor of 410)
  • ...
  • 410 / 19 = 21.578947368421 (the remainder is 11, so 19 is not a divisor of 410)
  • 410 / 20 = 20.5 (the remainder is 10, so 20 is not a divisor of 410)