What are the divisors of 4282?

1, 2, 2141, 4282

2 even divisors

2, 4282

2 odd divisors

1, 2141

How to compute the divisors of 4282?

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

  • 4282 / 1 = 4282 (the remainder is 0, so 1 is a divisor of 4282)
  • 4282 / 2 = 2141 (the remainder is 0, so 2 is a divisor of 4282)
  • 4282 / 3 = 1427.3333333333 (the remainder is 1, so 3 is not a divisor of 4282)
  • ...
  • 4282 / 4281 = 1.0002335902826 (the remainder is 1, so 4281 is not a divisor of 4282)
  • 4282 / 4282 = 1 (the remainder is 0, so 4282 is a divisor of 4282)

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 4282 (i.e. 65.436992595932). 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 )

  • 4282 / 1 = 4282 (the remainder is 0, so 1 and 4282 are divisors of 4282)
  • 4282 / 2 = 2141 (the remainder is 0, so 2 and 2141 are divisors of 4282)
  • 4282 / 3 = 1427.3333333333 (the remainder is 1, so 3 is not a divisor of 4282)
  • ...
  • 4282 / 64 = 66.90625 (the remainder is 58, so 64 is not a divisor of 4282)
  • 4282 / 65 = 65.876923076923 (the remainder is 57, so 65 is not a divisor of 4282)