What are the divisors of 791?

1, 7, 113, 791

4 odd divisors

1, 7, 113, 791

How to compute the divisors of 791?

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

  • 791 / 1 = 791 (the remainder is 0, so 1 is a divisor of 791)
  • 791 / 2 = 395.5 (the remainder is 1, so 2 is not a divisor of 791)
  • 791 / 3 = 263.66666666667 (the remainder is 2, so 3 is not a divisor of 791)
  • ...
  • 791 / 790 = 1.0012658227848 (the remainder is 1, so 790 is not a divisor of 791)
  • 791 / 791 = 1 (the remainder is 0, so 791 is a divisor of 791)

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 791 (i.e. 28.12472222085). 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 )

  • 791 / 1 = 791 (the remainder is 0, so 1 and 791 are divisors of 791)
  • 791 / 2 = 395.5 (the remainder is 1, so 2 is not a divisor of 791)
  • 791 / 3 = 263.66666666667 (the remainder is 2, so 3 is not a divisor of 791)
  • ...
  • 791 / 27 = 29.296296296296 (the remainder is 8, so 27 is not a divisor of 791)
  • 791 / 28 = 28.25 (the remainder is 7, so 28 is not a divisor of 791)