What is 35 mod 3?
Often represented by the operator "mod", the modulo is a mathematical operation that gives the remainder of an integer division.
The result of 35 mod 3 is 2.
How to compute 35 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:
(where N is the dividend, M is the divisor and represents the integer part of the quotient)
- 35 / 3 = 11.666666666667
- ⌊11.666666666667⌋ = 11 (We only keep the integer part)
- 3 × 11 = 33
- 35 - 33 = 2 (Subtracting gives us the remainder)
In short: 35 − (3 × ⌊35 / 3⌋) = 2
Is 35 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 35 mod 3 is 2, this indicates that dividing 35 by 3 leaves a remainder of 2. Therefore, no, since the remainder isn't zero, 35 is not divisible by 3.