This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: number if that number is bigger than the modulus. For example. “13 ( mod 12)” means __________ because . .. Algorithm for calculating Modulo: • Divide the number by the modulus, the remainder is the answer • The remainder is usually positive and less than the modulus MAE3811–Sp. 2010 Mahoney–4 Modular Arithmetic The nmodular integers are the numbers And have at least two operations defined by How do you think modular subtraction and modular division are defined? 3 MAE3811–Sp. 2010 Mahoney–5 Modular Arithmetic, n = 5 Examples: MAE3811–Sp. 2010 Mahoney–6 Modular Arithmetic, n=5, The Full Operation Tables Observations: 4 MAE3811–Sp. 2010 Mahoney–7 Modular Arithmetic, n = 6 Examples: MAE3811–Sp. 2010 Mahoney–8 Modular Arithmetic, n=5, The Full Operation Tables Observations:...
View
Full Document
 Spring '11
 Mahoney
 Addition, Division, Remainder

Click to edit the document details