Divisibility Condition for abbb

XAT 2024 · Quantitative Ability & Data Interpretation · Easy · Number System

Consider a 4-digit number of the form abbbabbb, i.e., the first digit is aa (a>0a > 0) and the last three digits are all bb.

Which of the following conditions is both NECESSARY and SUFFICIENT to ensure that the 4-digit number is divisible by aa?

  1. A.

    b is divisible by a

  2. B.

    b is equal to 0

  3. C.

    21b is divisible by a

  4. D.

    9b is divisible by a

  5. E.

    3b is divisible by a

Answer

E

Explanation

The 4-digit number N=1000a+111bN = 1000a + 111b. For NN to be divisible by aa, 1000a+111b≡0(moda)  ⟺  111b≡0(moda)1000a + 111b \equiv 0 \pmod a \iff 111b \equiv 0 \pmod a. Since 111=3×37111 = 3 \times 37, 111b=37×3b111b = 37 \times 3b. Since aa is a single digit (1≤a≤91 \le a \le 9), aa is coprime to 37. Therefore, 37×3b37 \times 3b is divisible by aa if and only if 3b3b is divisible by aa.

Related Number System questions

Practise this under exam conditions

Sign in to solve it with a live timer, the on-screen CAT calculator, and streak and accuracy tracking across every question you attempt.

Solve in the workspace