Here we will explain what 1 mod 13 means and show how to calculate it. 1 mod 13 is short for 1 modulo 13 and it can also be called 1 modulus 13.
Modulo is the operation of finding the Remainder when you divide two numbers. Therefore, when you ask "What is 1 mod 13?" you are asking "What is the Remainder when you divide 1 by 13?".
We will show you two methods of finding 1 mod 13 (1 modulo 13). To differentiate our methods, we will call them the "Modulo Method" and the "Modulus Method".
Before we continue, we remind you of what the different parts of a division problem are called so you can follow along: Dividend / Divisor = Quotient and in this case 1 is the Dividend, 13 is the Divisor, and the answer is called the Quotient.
Furthermore, the Quotient x.y has two parts: x to the left of the decimal point is the Whole part, and y to the right of the decimal point is the Fractional part.
Modulo Method
To find 1 mod 13 using the Modulo Method, we first divide the Dividend (1) by the Divisor (13).
Second, we multiply the Whole part of the Quotient in the previous step by the Divisor (13).
Then finally, we subtract the answer in the second step from the Dividend (1) to get the answer. Here is the math to illustrate how to get 1 mod 13 using our Modulo Method:
1 ÷ 13 ≈ 0.076923
0 × 13 = 0
1 - 0 = 1
Thus, the answer to "What is 1 mod 13?" is 1.
Modulus Method
To find 1 mod 13 using the Modulus Method, we first find the highest multiple of the Divisor (13) that is equal to or less than the Dividend (1).
Then, we subtract the highest Divisor multiple from the Dividend to get the answer to 1 modulus 13 (1 mod 13):
Multiples of 13 are 0, 13, 26, 39, etc. and the highest multiple of 13 equal to or less than 1 is 0. Therefore, to get the answer:
1 - 0 = 1
Thus, once again, the answer to "What is 1 mod 13?" is 1.
Modulo Calculator
Do you have another "mod" problem you need solved? If so, please enter it here.