What are the divisors of 3571?

1, 3571

2 odd divisors

1, 3571

How to compute the divisors of 3571?

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

  • 3571 / 1 = 3571 (the remainder is 0, so 1 is a divisor of 3571)
  • 3571 / 2 = 1785.5 (the remainder is 1, so 2 is not a divisor of 3571)
  • 3571 / 3 = 1190.3333333333 (the remainder is 1, so 3 is not a divisor of 3571)
  • ...
  • 3571 / 3570 = 1.0002801120448 (the remainder is 1, so 3570 is not a divisor of 3571)
  • 3571 / 3571 = 1 (the remainder is 0, so 3571 is a divisor of 3571)

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 3571 (i.e. 59.757844673315). 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 )

  • 3571 / 1 = 3571 (the remainder is 0, so 1 and 3571 are divisors of 3571)
  • 3571 / 2 = 1785.5 (the remainder is 1, so 2 is not a divisor of 3571)
  • 3571 / 3 = 1190.3333333333 (the remainder is 1, so 3 is not a divisor of 3571)
  • ...
  • 3571 / 58 = 61.568965517241 (the remainder is 33, so 58 is not a divisor of 3571)
  • 3571 / 59 = 60.525423728814 (the remainder is 31, so 59 is not a divisor of 3571)