Skip to content
Question

Q.(a) Evaluate (137+995)(mod12)(137 + 995) \pmod{12}.

(OR)
(b) Find the unit's digit of 121212^{12}.
CBSECBSE Class XII Board 2024Subjective· 2mImportance★★★★★est
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

  1. The sum 137+995=1132137+995=1132 leaves remainder 44 on division by 1212;
  2. the unit's digit of 121212^{12} is 66.

(a+b) mod m=((a mod m)+(b mod m)) mod m(a+b)\bmod m=\big((a\bmod m)+(b\bmod m)\big)\bmod m. For a unit's digit, the last digit of nkn^k equals the last digit of (last digit of n)k(\text{last digit of }n)^k, and powers of a digit repeat in a short cycle.

Part (a): Evaluate (137+995)(mod12)(137+995)\pmod{12}

  1. 137=12×11+5137=12\times 11+5, so 137≡5(mod12)137\equiv 5\pmod{12}.
  2. 995=12×82+11995=12\times 82+11, so 995≡11(mod12)995\equiv 11\pmod{12}.
  3. 137+995≡5+11=16(mod12)137+995\equiv 5+11=16\pmod{12}.
  4. 16=12×1+416=12\times 1+4, so 16≡4(mod12)16\equiv 4\pmod{12}.
  5. Check directly: 137+995=1132=12×94+4137+995=1132=12\times 94+4. Remainder =4=4.

Part (b): Unit's digit of 121212^{12}

6. The unit's digit of 121212^{12} is the unit's digit of 2122^{12} (only the last digit of the base matters). …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.