Question

Difficulty: HardDivisibility Rules and Remainder Theorem

Let N=5391−3182N = 53^{91} - 31^{82}. When the value of NN is divided by 1111, which of the following represents the correct remainder?

  1. 5Answer
  2. B
    6
  3. C
    2
  4. D
    0

Answer

The correct remainder is 5.
By finding the remainders of the bases (53≡−2(mod11)53 \equiv -2 \pmod{11} and 31≡−2(mod11)31 \equiv -2 \pmod{11}) and reducing the exponents using Fermat's Little Theorem modulo 10 (91≡1(mod10)91 \equiv 1 \pmod{10} and 82≡2(mod10)82 \equiv 2 \pmod{10}), the expression simplifies to (−2)1−(−2)2=−6(-2)^1 - (-2)^2 = -6. Converting this negative remainder to a true positive remainder yields −6+11=5-6 + 11 = 5.

Step-by-Step Solution

1
Determine the remainders of the bases 53 and 31 when divided by 11.
53≡9≡−2(mod11)53 \equiv 9 \equiv -2 \pmod{11} and 31≡9≡−2(mod11)31 \equiv 9 \equiv -2 \pmod{11}.
Converting to negative remainders significantly simplifies the calculations for large powers.
2
Apply Fermat's Little Theorem to reduce the exponents.
Since 11 is a prime number, the cyclicity is 11−1=1011 - 1 = 10. Reducing the exponents modulo 10 gives 91≡1(mod10)91 \equiv 1 \pmod{10} and 82≡2(mod10)82 \equiv 2 \pmod{10}.
Fermat's theorem states that ap−1≡1(modp)a^{p-1} \equiv 1 \pmod{p}, meaning exponents can be reduced by finding their remainder when divided by p−1p-1.
3
Evaluate the reduced expression under modulo 11.
(−2)1−(−2)2=−2−4=−6(-2)^1 - (-2)^2 = -2 - 4 = -6.
Substituting the simplified bases and exponents provides the intermediate remainder.
4
Convert the negative intermediate remainder into a valid positive remainder.
−6+11=5-6 + 11 = 5.
A final remainder must always be a non-negative integer strictly less than the divisor.

Key Concept

Applying Fermat's Little Theorem and correctly handling negative remainders in modular arithmetic.
Rate this question