What are the divisors of 157?

1, 157

2 odd divisors

1, 157

How to compute the divisors of 157?

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

  • 157 / 1 = 157 (the remainder is 0, so 1 is a divisor of 157)
  • 157 / 2 = 78.5 (the remainder is 1, so 2 is not a divisor of 157)
  • 157 / 3 = 52.333333333333 (the remainder is 1, so 3 is not a divisor of 157)
  • ...
  • 157 / 156 = 1.0064102564103 (the remainder is 1, so 156 is not a divisor of 157)
  • 157 / 157 = 1 (the remainder is 0, so 157 is a divisor of 157)

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 157 (i.e. 12.529964086142). 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 )

  • 157 / 1 = 157 (the remainder is 0, so 1 and 157 are divisors of 157)
  • 157 / 2 = 78.5 (the remainder is 1, so 2 is not a divisor of 157)
  • 157 / 3 = 52.333333333333 (the remainder is 1, so 3 is not a divisor of 157)
  • ...
  • 157 / 11 = 14.272727272727 (the remainder is 3, so 11 is not a divisor of 157)
  • 157 / 12 = 13.083333333333 (the remainder is 1, so 12 is not a divisor of 157)