What is 11 mod 3?

How to compute 11 mod 3?

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

In short: 11 − (3 × ⌊11 / 3⌋) = 2

Is 11 divisible by 3?

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

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