CAT 2024 Slot 2 Quant Q2

  • Quantitative Aptitude
  • Number System › Remainder
  • Easy
  • Multiple choice
  • CAT_2024_SLOT2_QA_Q02

Question 2

When 33333^{333} is divide by 11, the remainder is

  1. A

    10

    Answer A in PrepSoc practice
  2. B

    1

    Answer B in PrepSoc practice
  3. C

    6

    Answer C in PrepSoc practice
  4. D

    5

    Answer D in PrepSoc practice

Answer this questionOr tap an option. Opens in practice mode, free, no sign-in.

Show answer and solution

Answer: (D)

5

Solution

  • Use Fermat's Little Theorem: 310≡1(mod11)3^{10} \equiv 1 \pmod{11}.

  • Break down the power: 3333=(310)33×333^{333} = (3^{10})^{33} \times 3^3.

  • Simplify using modulo: 133×27≡27(mod11)1^{33} \times 27 \equiv 27 \pmod{11}.

  • 27÷1127 \div 11 gives a remainder of 55.

Detailed explanation

Concept: Modular Arithmetic and Fermat's Little Theorem.

  1. We need to find the remainder of 33333^{333} when divided by 11.

  2. By Fermat's Little Theorem, ap−1≡1(modp)a^{p-1} \equiv 1 \pmod p for prime pp and gcd⁡(a,p)=1\gcd(a, p) = 1.

  3. Here, p=11p=11, so 310≡1(mod11)3^{10} \equiv 1 \pmod{11}.

  4. Divide the exponent 333 by 10 to find the remainder: 333=10×33+3333 = 10 \times 33 + 3.

  5. We can write 3333=310×33+3=(310)33×333^{333} = 3^{10 \times 33 + 3} = (3^{10})^{33} \times 3^3.

  6. Substitute the congruence: 3333≡133×33(mod11)3^{333} \equiv 1^{33} \times 3^3 \pmod{11}.

  7. Calculate 33=273^3 = 27.

  8. Find 27(mod11)27 \pmod{11}: 27=2×11+527 = 2 \times 11 + 5.

  9. The remainder is 5.

Practise similar questions

Practice 1 CAT_2024_SLOT2_QA_Q02_SQ01

When 24442^{444} is divided by 11, the remainder is

  1. A

    3

  2. B

    5

  3. C

    7

  4. D

    9

Show answer and solution

Answer: (B)

5

Solution

  • By Fermat's Little Theorem, 210≡1(mod11)2^{10} \equiv 1 \pmod{11}.

  • Break down the exponent: 444=10×44+4444 = 10 \times 44 + 4.

  • Apply modulo: 2444≡(210)44×24≡144×16(mod11)2^{444} \equiv (2^{10})^{44} \times 2^4 \equiv 1^{44} \times 16 \pmod{11}.

  • Calculate 16(mod11)=516 \pmod{11} = 5 (Option 2).

Practice 2 CAT_2024_SLOT2_QA_Q02_SQ02

When 55555^{555} is divided by 13, the remainder is

  1. A

    3

  2. B

    6

  3. C

    8

  4. D

    11

Show answer and solution

Answer: (C)

8

Solution

  • By Fermat's Little Theorem, 512≡1(mod13)5^{12} \equiv 1 \pmod{13}.

  • Divide the exponent: 555=12×46+3555 = 12 \times 46 + 3.

  • Simplify: 5555≡(512)46×53≡1×125(mod13)5^{555} \equiv (5^{12})^{46} \times 5^3 \equiv 1 \times 125 \pmod{13}.

  • Find 125(mod13)=8125 \pmod{13} = 8 (Option 3).

Practise this question with timing, notes and your mistake notebook.

Practise in PrepSoc