Modulo H. The modulo operation is to be distinguished from the. We have ( 123) = ( 23) ( 13) and ( 132) = ( 23) ( 12) and g ρ l e g ∈ h.
In effect, it generalises the notion of integers modulo some number n, since, in that case, one considers the integers in equivalence classes according to how they differ by a multiple of n.
For these cases there is an operator called the modulo operator (abbreviated as mod). We have ( 123) = ( 23) ( 13) and ( 132) = ( 23) ( 12) and g ρ l e g ∈ h. Most of the functions defined in this module call platform c library functions with the. Given two numbers, a (the dividend) and n (the divisor), a modulo n (abbreviated as a mod n) is the remainder from the division of a by n.for instance, the expression 7 mod 5 would evaluate to 2 because 7 divided by 5 leaves a remainder of 2, while 10 mod 5 would evaluate to.
Nessun commento:
Posta un commento