Question

Find the residue of \( (67 + 89 + 90 + 87) \pmod{11} \):

• A. 3
• B. 0
• C. 2
• D. 1

Hint:

In modular arithmetic, it's often easier to use negative residues for numbers close to the modulus. For example, \( 87 \equiv 10 \pmod{11} \) is the same as \( 87 \equiv -1 \pmod{11} \). The sum would then be \( 1 + 1 + 2 - 1 = 3 \), giving the answer directly.

Answer 1

The Correct Option is A

Step 1: Concept Overview:

This problem uses modular arithmetic. The remainder of a sum modulo \(n\) equals the sum of individual remainders modulo \(n\), simplifying calculations by using smaller numbers.

Step 2: Core Formula:

The core property is \[ (a + b + c + d) \pmod{n} = \left( (a \pmod{n}) + (b \pmod{n}) + (c \pmod{n}) + (d \pmod{n}) \right) \pmod{n}. \] We'll find each number's remainder when divided by 11.

Step 3: Step-by-step Solution:

1. \( 67 \div 11 \): \( 67 = 6 \times 11 + 1 \). Therefore, \( 67 \equiv 1 \pmod{11} \).
2. \( 89 \div 11 \): \( 89 = 8 \times 11 + 1 \). Therefore, \( 89 \equiv 1 \pmod{11} \).
3. \( 90 \div 11 \): \( 90 = 8 \times 11 + 2 \). Therefore, \( 90 \equiv 2 \pmod{11} \).
4. \( 87 \div 11 \): \( 87 = 7 \times 11 + 10 \). Therefore, \( 87 \equiv 10 \pmod{11} \).

Now, sum the remainders: \[ 1 + 1 + 2 + 10 = 14. \] Finally, find the remainder of this sum modulo 11: \[ 14 \pmod{11}: \quad 14 = 1 \times 11 + 3. \quad \text{So,} \quad 14 \equiv 3 \pmod{11}. \]

Step 4: Answer:

The final remainder is \( \boxed{3} \).