What is 12 mod 9?

How to compute 12 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:

$\mathrm{Remainder}=N-(M\times \lfloor \frac{N}{M}\rfloor )$

(where N is the dividend, M is the divisor and $\lfloor \frac{N}{M}\rfloor$ represents the integer part of the quotient)

1. 12 / 9 = 1.3333333333333
2. ⌊1.3333333333333⌋ = 1 (We only keep the integer part)
3. 9 × 1 = 9
4. 12 - 9 = 3 (Subtracting gives us the remainder)

In short: 12 − (9 × ⌊12 / 9⌋) = 3

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