Modular Arithmetic Basic - Cryptography

For Modular Arithmetic what value is the most important?

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

Tags

CCSS.7.NS.A.2C

What is 7 mod 3?

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

Tags

CCSS.8.EE.A.1

What is 57 mod 7?

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

Tags

CCSS.8.EE.A.1

What is 99 mod 100?

• 99 mod 100
• 100 mod 99
• 1 mod 100
• 100 mod 1

Tags

CCSS.8.EE.A.1

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

Tags

CCSS.7.NS.A.1D

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

• 13 = 126 * 0 + 13
• 126 = 13 * 9 + 9
• 13 =  126 * 0 + 13
• 13 = 126 + 13 

Tags

CCSS.7.NS.A.2C

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

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

Tags

CCSS.7.NS.A.1D

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

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

Tags

CCSS.7.NS.A.1D

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

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

What is 14 mod 8 - 15 mod 8 congruent to?

• 7 mod 8
• 1 mod 8
• 0 mod 8
• 6 mod 8

Tags

CCSS.7.NS.A.2C