First Maple Demo - Feb 18th in the classroom computer lab
Dr. Sarah's 3110 Maple Demo on Modular Arithmetic
Based on a section from Gallian's Contemporary Abstract Algebra
Work in Groups of 2 on 1 computer. Type your answers into the computer and save often into the public-saves folder.
Definition of a mod n
Let n be a fixed positive integer. For any integer a, a mod n , read "a mod n" or "a modulo n" is the remainder of a/n. Maple can do modular arithmetic very easily. Execute each example, and then explain in words using the definition
why Maple's answer is correct.
> 8 mod 3;
Explain why this is correct?