What is 71 mod 36?

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

The result of 71 mod 36 is 35.

How to compute 71 mod 36?

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. 71 / 36 = 1.9722222222222
  2. ⌊1.9722222222222⌋ = 1 (We only keep the integer part)
  3. 36 × 1 = 36
  4. 71 - 36 = 35 (Subtracting gives us the remainder)

In short: 71 − (36 × ⌊71 / 36⌋) = 35

Is 71 divisible by 36?

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

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