What is 13 mod 4?

How to compute 13 mod 4?

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

In short: 13 − (4 × ⌊13 / 4⌋) = 1

Is 13 divisible by 4?

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

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