What is 91 mod 10?

How to compute 91 mod 10?

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

In short: 91 − (10 × ⌊91 / 10⌋) = 1

Is 91 divisible by 10?

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

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