Skip to content
NCERT Exemplar · Q11

Q.Find the number of positive integers greater than 60006000 and less than 70007000 which are divisible by 55, provided that no digit is to be repeated.

Assam AhsecShort· 3mImportance★★★★★est
59% · 77/130 Questions
🔒 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 →

We need to form 4-digit numbers between 6000 and 7000, divisible by 5, with no repeated digits. This means the thousands digit is 6, and the units digit is either 0 or 5. By considering these two cases and counting the available choices for the remaining digits, we find there are 112 such integers.

To find the number of positive integers that meet all the given conditions, we will determine the number of choices for each digit position, moving from the most constrained positions first. The number must be a 4-digit number, say d1d2d3d4d_1 d_2 d_3 d_4, where d1d_1 is the thousands digit, d2d_2 is the hundreds digit, d3d_3 is the tens digit, and d4d_4 is the units digit.

Here are the conditions we must satisfy:

  1. The number is greater than 60006000 and less than 70007000.
  2. The number is divisible by 55.
  3. No digit is to be repeated.

Let's break this down step by step.

  1. Determine the thousands digit (d1d_1).

    The condition that the number is greater than 60006000 and less than 70007000 immediately tells us that it must be a 4-digit number, and its thousands digit must be 66.

    So, d1=6d_1 = 6.

    There is only 11 choice for the thousands digit.

    Digits available for use: {0,1,2,3,4,5,6,7,8,9}\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}.

    Digit used: 66.

  2. Determine the units digit (d4d_4).

    For a number to be divisible by 55, its units digit must be either 00 or 55.

    So, d4∈{0,5}d_4 \in \{0, 5\}.

    Since the thousands digit d1=6d_1 = 6 is neither 00 nor 55, there is no immediate conflict with the "no repeated digits" rule for d1d_1 and d4d_4. However, the choice of d4d_4 will affect the remaining available digits for d2d_2 and d3d_3. We will consider two separate cases based on the value of d4d_4.

  3. Case 1: The units digit (d4d_4) is 00.

    • Thousands digit d1=6d_1 = 6 (1 choice).
    • Units digit d4=0d_4 = 0 (1 choice).
    • Digits used so far: 66 and 00.
    • Remaining available digits for d2d_2 and d3d_3: From the set {0,1,2,3,4,5,6,7,8,9}\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}, we exclude 66 and 00. This leaves us with 10−2=810 - 2 = 8 digits: {1,2,3,4,5,7,8,9}\{1, 2, 3, 4, 5, 7, 8, 9\}.
    • Determine the hundreds digit (d2d_2). We can choose any of the 88 remaining available digits for d2d_2. So, there are 88 choices for d2d_2.
    • Determine the tens digit (d3d_3). After choosing d2d_2, we have used three distinct digits (d1,d4,d2d_1, d_4, d_2). There are 10−3=710 - 3 = 7 digits remaining for d3d_3. So, there are 77 choices for d3d_3.
    • The number of integers in this case is 1×8×7×1=561 \times 8 \times 7 \times 1 = 56.
  4. Case 2: The units digit (d4d_4) is 55.

    • Thousands digit d1=6d_1 = 6 (1 choice). …

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.