What are the divisors of 5743?

1, 5743

2 odd divisors

1, 5743

How to compute the divisors of 5743?

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

  • 5743 / 1 = 5743 (the remainder is 0, so 1 is a divisor of 5743)
  • 5743 / 2 = 2871.5 (the remainder is 1, so 2 is not a divisor of 5743)
  • 5743 / 3 = 1914.3333333333 (the remainder is 1, so 3 is not a divisor of 5743)
  • ...
  • 5743 / 5742 = 1.0001741553466 (the remainder is 1, so 5742 is not a divisor of 5743)
  • 5743 / 5743 = 1 (the remainder is 0, so 5743 is a divisor of 5743)

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 5743 (i.e. 75.78258375115). 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 )

  • 5743 / 1 = 5743 (the remainder is 0, so 1 and 5743 are divisors of 5743)
  • 5743 / 2 = 2871.5 (the remainder is 1, so 2 is not a divisor of 5743)
  • 5743 / 3 = 1914.3333333333 (the remainder is 1, so 3 is not a divisor of 5743)
  • ...
  • 5743 / 74 = 77.608108108108 (the remainder is 45, so 74 is not a divisor of 5743)
  • 5743 / 75 = 76.573333333333 (the remainder is 43, so 75 is not a divisor of 5743)