What is 1 mod 13?
Often represented by the operator "mod", the modulo is a mathematical operation that gives the remainder of an integer division.
The result of 1 mod 13 is 1.
How to compute 1 mod 13?
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)
- 1 / 13 = 0.076923076923077
- ⌊0.076923076923077⌋ = 0 (We only keep the integer part)
- 13 × 0 = 0
- 1 - 0 = 1 (Subtracting gives us the remainder)
In short: 1 − (13 × ⌊1 / 13⌋) = 1
Is 1 divisible by 13?
A number is said to be divisible by another number, if the remainder of the division is zero.
Given that the result of 1 mod 13 is 1, this indicates that dividing 1 by 13 leaves a remainder of 1. Therefore, no, since the remainder isn't zero, 1 is not divisible by 13.