CAT 2024 Slot 1 Quant Q1

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

Question 1

When 1010010^{100} is divided by 7, the remainder is

  1. A

    6

    Answer A in PrepSoc practice
  2. B

    1

    Answer B in PrepSoc practice
  3. C

    4

    Answer C in PrepSoc practice
  4. D

    3

    Answer D in PrepSoc practice

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

Show answer and solution

Answer: (C)

4

Solution

  • Simplify the base: 10÷710 \div 7 leaves remainder 33. So we need 3100(mod7)3^{100} \pmod 7.

  • Find the cycle: Fermat's Little Theorem says ap−1≡1(modp)a^{p-1} \equiv 1 \pmod p. So 36≡1(mod7)3^6 \equiv 1 \pmod 7.

  • Divide the power by cycle length: 100÷6100 \div 6 leaves a remainder of 44.

  • The answer is 34(mod7)3^4 \pmod 7.

  • 34=813^4 = 81, and 81÷7=1181 \div 7 = 11 with a remainder of 44.

Detailed explanation

Concept: Modular Arithmetic and Cyclicity

  1. We need to find the remainder when 1010010^{100} is divided by 7. In modular arithmetic terms, find 10100(mod7)10^{100} \pmod 7.

  2. First, simplify the base modulo 7: 10≡3(mod7)10 \equiv 3 \pmod 7.

  3. Thus, 10100≡3100(mod7)10^{100} \equiv 3^{100} \pmod 7.

  4. Find the cyclicity of powers of 3 modulo 7:

PowerValue(mod7)\pmod 7
313^133
323^292
333^3276
343^4814
353^52435
363^67291
  1. The cycle length is 6, since 36≡1(mod7)3^6 \equiv 1 \pmod 7 (also known from Fermat's Little Theorem: ap−1≡1(modp)a^{p-1} \equiv 1 \pmod p).

  2. Divide the exponent 100 by the cycle length 6: 100=6×16+4100 = 6 \times 16 + 4.

  3. Therefore, 3100=36×16+4=(36)16×34≡116×34≡34(mod7)3^{100} = 3^{6 \times 16 + 4} = (3^6)^{16} \times 3^4 \equiv 1^{16} \times 3^4 \equiv 3^4 \pmod 7.

  4. From the table, 34≡4(mod7)3^4 \equiv 4 \pmod 7. The remainder is 4.

Practise similar questions

Practice 1 CAT_2024_SLOT1_QA_Q01_SQ01

When 1812518^{125} is divided by 7, the remainder is

  1. A

    2

  2. B

    4

  3. C

    1

  4. D

    5

Show answer and solution

Answer: (A)

2

Solution

  • Reduce the base: 18÷718 \div 7 leaves remainder 44, so evaluate 4125(mod7)4^{125} \pmod 7.

  • Find the cyclicity: 41≡44^1 \equiv 4, 42≡24^2 \equiv 2, 43≡1(mod7)4^3 \equiv 1 \pmod 7. Cycle length is 33.

  • Divide the exponent by cycle length: 125=3×41+2125 = 3 \times 41 + 2, leaving a remainder of 22.

  • The remainder is 42(mod7)=16(mod7)=24^2 \pmod 7 = 16 \pmod 7 = 2.

  • Hence, the remainder is 22, corresponding to Option 1.

Practice 2 CAT_2024_SLOT1_QA_Q01_SQ02

When 1510315^{103} is divided by 11, the remainder is

  1. A

    3

  2. B

    5

  3. C

    9

  4. D

    4

Show answer and solution

Answer: (C)

9

Solution

  • Reduce the base: 15÷1115 \div 11 gives remainder 44, so we evaluate 4103(mod11)4^{103} \pmod{11}.

  • Track the cyclicity: 41=44^1 = 4, 42=54^2 = 5, 43=94^3 = 9, 44=34^4 = 3, 45=1(mod11)4^5 = 1 \pmod{11}. Cycle is 55.

  • Divide the exponent: 103=5×20+3103 = 5 \times 20 + 3, yielding a remainder of 33.

  • Evaluate the equivalent power: 43=64=11×5+9≡9(mod11)4^3 = 64 = 11 \times 5 + 9 \equiv 9 \pmod{11}.

  • The remainder is 99, corresponding to Option 3.

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

Practise in PrepSoc