What is 36 mod 9?

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

The result of 36 mod 9 is 0.

How to compute 36 mod 9?

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

In short: 36 − (9 × ⌊36 / 9⌋) = 0

Is 36 divisible by 9?

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

Given that the result of 36 mod 9 is 0, this indicates that dividing 36 by 9 leaves no remainder. Therefore, yes, 36 is indeed divisible by 9.