What is 100 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 100 mod 9 is 1.

How to compute 100 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. 100 / 9 = 11.111111111111
  2. ⌊11.111111111111⌋ = 11 (We only keep the integer part)
  3. 9 × 11 = 99
  4. 100 - 99 = 1 (Subtracting gives us the remainder)

In short: 100 − (9 × ⌊100 / 9⌋) = 1

Is 100 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 100 mod 9 is 1, this indicates that dividing 100 by 9 leaves a remainder of 1. Therefore, no, since the remainder isn't zero, 100 is not divisible by 9.