modular arithmetic

For Modular Arithmetic what value is the most important?

• The Modulo
• The Given Number
• The Remainder
• The Divisor

What is 7 mod 3?

• 1 mod 3
• 2 mod 3
• 3 mod 3
• 0 mod 3

What is 57 mod 7?

• 0 mod 7
• 1 mod 7
• 7 mod 7
• -1 mod 7

What does 36 mod 13 look like using the Quotient Remainder Theorem?

• 36 = 13 * 2 + 10
• 36 = 10 * 3 + 6
• 13 = 36 * 1 - 23
• 6 = 36  - 10 * 3

What is 9 mod 2 - 10 mod 2 congruent to?

• 0 mod 2
• 1 mod 2
• -1 mod 2
• -2 mod 2

What is 6 mod 9 + 11 mod 9 congruent to?

• 8 mod 9
• 6 mod 9
• 7 mod 9
• 0 mod 9

what is (-5 mod 4) - (-3 mod 4) congruent to?

• 2 mod 4
• 1 mod 4
• -2 mod 4
• -1 mod 4

a system of arithmetic for integers, which considers the Remainder

• Modular Arithmetic

• Division

• Divisibility Theorems

• Division Algorithm

(51+29) mod 3

• 3 (modulo 4)

• 2 (modulo 3)

• 3 (modulo 2)

• 4 (modulo 3)

(325+69) mod 13

• 3 (modulo 13)

• 4 (modulo 13)

• 5 (modulo 13)

• 6 (modulo 13)