Modular Division

In the equation A = B x Q + R, what does R represent?

• Divisor

• Remainder

• Dividend

• Quotient

Tags

CCSS.4.NBT.B.6

What does A ≡ R (mod B) signify?

• A is less than R

• A is congruent to R

• A is equal to R

• A is greater than R

Which of the following is true about the equation A/B mod C?

• It can be a positive or negative integer

• It is not defined

• It is always a negative integer

• It is always a positive integer

Tags

CCSS.7.NS.A.2C

Is a system of arithmetic for integers, where the numbers wrap around upon reaching a certain value, the modulus. It is also know as taking the remainder.

• residue system

• modular arithmetic

Tags

CCSS.7.NS.A.1D

In addition, if n>0 and r is the remainder when the Division of Algorithm is used to divide b by n, then r is called?

• least residue

• congruence

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 9 mod 2 - 10 mod 2 congruent to?

• 0 mod 2

• 1 mod 2

• -1 mod 2

• -2 mod 2

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

• 7 mod 8

• 1 mod 8

• 0 mod 8

• 6 mod 8

What is 99 mod 100?

• 99 mod 100

• 100 mod 99

• 1 mod 100

• 100 mod 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