Eg, you could teach modular arithmetic and then immediately show the power of this method.
Explains simple encoding and decoding of messages for student learning of modular arithmetic.
There are also exercises leading to the concept of place value and work with modular arithmetic.
Students explore the properties of clock arithmetic or a modular arithmetic system.
We note that this is generally useful, and also useful for public key algorithms using modular arithmetic.
Essential topics related to these aspects of information processing are basic set theory, logic, and modular arithmetic.
modular arithmetic in Technology
mathematics (Or "clock arithmetic") A kind of integer arithmetic that reduces all numbers to one of a fixed set [0..N-1] (this would be "modulo N arithmetic") by effectively repeatedly adding or subtracting N (the "modulus") until the result is within this range. The original mathematical usage considers only __equivalence__ modulo N. The numbers being compared can take any values, what matters is whether they differ by a multiple of N. Computing usage however, considers modulo to be an operator that returns the remainder after integer division of its first argument by its second. Ordinary "clock arithmetic" is like modular arithmetic except that the range is [1..12] whereas modulo 12 would be [0..11]. (2003-03-28)