Circular Modular Addition and Multiplication Tables
Modular Arithmetic
Arithmetic dealing with the remainders after integers are divided by a fixed "modulus" m. Basically, it is a kind of integer arithmetic that reduces all numbers to ones that belongs to a fixed set [0 ... N-1]. We can say two integers, a and b, are congruent mod m (where m is a natural number) if both numbers divided by m produce the same remainder. In other words, m must evenly divide their difference, a - b.
Circular Patterns with Modular Arithmetic
Addition and Multiplication in Mod [6]
![Addition and Multiplication in Mod [6]](https://www.geogebra.org/resource/hxfvxkhu/q43qfQ75CHZv5b03/material-hxfvxkhu.png)
Activity: Modular Arithmetic
1.) Practicing Addition: Do the following operations in Mod [8]
a.) 6+3= ?
b.) 12+4=?
c.) 2+1=?
2.) Practicing Multiplication: Do the following operations in Mod [6]
a.) 3 x 1=?
b.) 3 x 6=?
c.) 4 x 2=?
3.) Generation Patterns
a.) explore the patterns formed from different combinations of Mods and operations
b.) Fix the times at 2 , and increase the mod to the max and describe the pattern
c.) Fix the times at 3, and increase the mod to the max and describe the pattern
4.) Extension: What patterns do you notice in 3a, and 3b? Is there a name for these patterns?