What are the divisors of 1193?

1, 1193

2 odd divisors

1, 1193

How to compute the divisors of 1193?

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

  • 1193 / 1 = 1193 (the remainder is 0, so 1 is a divisor of 1193)
  • 1193 / 2 = 596.5 (the remainder is 1, so 2 is not a divisor of 1193)
  • 1193 / 3 = 397.66666666667 (the remainder is 2, so 3 is not a divisor of 1193)
  • ...
  • 1193 / 1192 = 1.0008389261745 (the remainder is 1, so 1192 is not a divisor of 1193)
  • 1193 / 1193 = 1 (the remainder is 0, so 1193 is a divisor of 1193)

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 1193 (i.e. 34.539832078341). 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 )

  • 1193 / 1 = 1193 (the remainder is 0, so 1 and 1193 are divisors of 1193)
  • 1193 / 2 = 596.5 (the remainder is 1, so 2 is not a divisor of 1193)
  • 1193 / 3 = 397.66666666667 (the remainder is 2, so 3 is not a divisor of 1193)
  • ...
  • 1193 / 33 = 36.151515151515 (the remainder is 5, so 33 is not a divisor of 1193)
  • 1193 / 34 = 35.088235294118 (the remainder is 3, so 34 is not a divisor of 1193)