Free Preparation Discussions
MENU
Eccouncil 212-81 Exam - Topic 10 Question 11 Discussion
Topic #: 10
What is the solution to the equation 8 mod 3?
2
https://en.wikipedia.org/wiki/Modulo_operation
The modulo operation returns the remainder or signed remainder of a division, after one number is divided by another (called the modulus of the operation).
Given two positive numbers a and n, a modulo n (abbreviated as a mod n) is the remainder of the Euclidean division of a by n, where a is the dividend and n is the divisor. The modulo operation is to be distinguished from the symbol mod, which refers to the modulus (or divisor) one is operating from.
For example, the expression '5 mod 2' would evaluate to 1, because 5 divided by 2 has a quotient of 2 and a remainder of 1, while '9 mod 3' would evaluate to 0, because the division of 9 by 3 has a quotient of 3 and a remainder of 0; there is nothing to subtract from 9 after multiplying 3 times 3.
Lai
10 months agoKaran
10 months agoGerald
10 months agoMarguerita
10 months agoYvonne
11 months agoYolando
11 months agoGoldie
11 months agoVesta
11 months agoLong
11 months agoHelaine
11 months agoBettye
11 months agoValda
11 months ago