Z Modulo N. In considering modular arithmetic (see here for review if needed), we can divide all integers into congruence classes modulo n. Let i represent the set.
We saw in theorem 3.1.3 that when we do arithmetic modulo some number $n$, the answer doesn't depend on which numbers we compute with, only that they are the same modulo $n$.
Modular arithmetic, sometimes called clock arithmetic, is a calculation that involves a number that resets itself to zero each time a whole number greater than 1, which is the. Congruenza modulo n in z. This is a counter that resets at a chosen number. We saw in theorem 3.1.3 that when we do arithmetic modulo some number $n$, the answer doesn't depend on which numbers we compute with, only that they are the same modulo $n$.
Nessun commento:
Posta un commento