What is 27 mod 17?

Often represented by the operator "mod", the modulo is a mathematical operation that gives the remainder of an integer division.

The result of 27 mod 17 is 10.

How to compute 27 mod 17?

The simplest approach is to use the "mod" operator (often denoted as "%" in many programming languages), but you could do it manually in the following way:

Remainder = N − ( M × ⌊ N M ⌋ )

(where N is the dividend, M is the divisor and ⌊ N M ⌋ represents the integer part of the quotient)

  1. 27 / 17 = 1.5882352941176
  2. ⌊1.5882352941176⌋ = 1 (We only keep the integer part)
  3. 17 × 1 = 17
  4. 27 - 17 = 10 (Subtracting gives us the remainder)

In short: 27 − (17 × ⌊27 / 17⌋) = 10

Is 27 divisible by 17?

A number is said to be divisible by another number, if the remainder of the division is zero.

Given that the result of 27 mod 17 is 10, this indicates that dividing 27 by 17 leaves a remainder of 10. Therefore, no, since the remainder isn't zero, 27 is not divisible by 17.