What is 67 mod 27?

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

The result of 67 mod 27 is 13.

How to compute 67 mod 27?

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. 67 / 27 = 2.4814814814815
  2. ⌊2.4814814814815⌋ = 2 (We only keep the integer part)
  3. 27 × 2 = 54
  4. 67 - 54 = 13 (Subtracting gives us the remainder)

In short: 67 − (27 × ⌊67 / 27⌋) = 13

Is 67 divisible by 27?

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

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