Question

Difficulty: HardRemainders and Units Digit Cyclicity

Let K=783442K = 7^{83} - 4^{42}. What is the remainder when K-K is divided by 55?

  1. A
    1
  2. B
    2
  3. 3Answer
  4. D
    4
  5. E
    0

Answer

3
To find the remainder of K-K divided by 5, first calculate K(mod5)K \pmod 5. By analyzing powers of 7 modulo 5, 712,724,733,7417^1 \equiv 2, 7^2 \equiv 4, 7^3 \equiv 3, 7^4 \equiv 1, so 783=74(20)+33(mod5)7^{83} = 7^{4(20)+3} \equiv 3 \pmod 5. For powers of 4 modulo 5, 414,4214^1 \equiv 4, 4^2 \equiv 1, so 4421(mod5)4^{42} \equiv 1 \pmod 5. Therefore, K31=2(mod5)K \equiv 3 - 1 = 2 \pmod 5. Consequently, K2(mod5)-K \equiv -2 \pmod 5. Adding the divisor 5 gives a non-negative remainder of 3.

Step-by-Step Solution

1
Find the remainder of 7837^{83} when divided by 55.
7127^1 \equiv 2, 7247^2 \equiv 4, 7337^3 \equiv 3, 741(mod5)7^4 \equiv 1 \pmod 5. Since 83=4×20+383 = 4 \times 20 + 3, 783733(mod5)7^{83} \equiv 7^3 \equiv 3 \pmod 5.
Powers of 7 follow a 4-term repeating remainder cycle modulo 5: (2, 4, 3, 1).
2
Find the remainder of 4424^{42} when divided by 55.
4144^1 \equiv 4, 421(mod5)4^2 \equiv 1 \pmod 5. Since 42 is even, 4421(mod5)4^{42} \equiv 1 \pmod 5.
Powers of 4 follow a 2-term repeating remainder cycle modulo 5: (4, 1).
3
Compute K(mod5)K \pmod 5.
K31=2(mod5)K \equiv 3 - 1 = 2 \pmod 5.
Modular subtraction allows evaluating terms independently.
4
Determine the positive remainder of K(mod5)-K \pmod 5.
K22+5=3(mod5)-K \equiv -2 \equiv -2 + 5 = 3 \pmod 5.
Standard division algorithm requires the remainder rr when dividing by 5 to satisfy 0r<50 \le r < 5.

Key Concept

Modular cyclicity and negative remainder conversion
Estimated Time:2m 0s
Rate this question