What are the divisors of 3457?

1, 3457

2 odd divisors

1, 3457

How to compute the divisors of 3457?

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

  • 3457 / 1 = 3457 (the remainder is 0, so 1 is a divisor of 3457)
  • 3457 / 2 = 1728.5 (the remainder is 1, so 2 is not a divisor of 3457)
  • 3457 / 3 = 1152.3333333333 (the remainder is 1, so 3 is not a divisor of 3457)
  • ...
  • 3457 / 3456 = 1.0002893518519 (the remainder is 1, so 3456 is not a divisor of 3457)
  • 3457 / 3457 = 1 (the remainder is 0, so 3457 is a divisor of 3457)

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 3457 (i.e. 58.796258384356). 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 )

  • 3457 / 1 = 3457 (the remainder is 0, so 1 and 3457 are divisors of 3457)
  • 3457 / 2 = 1728.5 (the remainder is 1, so 2 is not a divisor of 3457)
  • 3457 / 3 = 1152.3333333333 (the remainder is 1, so 3 is not a divisor of 3457)
  • ...
  • 3457 / 57 = 60.649122807018 (the remainder is 37, so 57 is not a divisor of 3457)
  • 3457 / 58 = 59.603448275862 (the remainder is 35, so 58 is not a divisor of 3457)