SOLVER7 Study. Nothing Else.
Chapter 6 Miscellaneous Examples Q23

How many numbers greater than \(1000000\) can be formed by using the digits \(1, 2, 0, 2, 4, 2, 4\ ?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have 7 numbered tiles: 0, 1, 2, 2, 2, 4, 4. You want to arrange all of them to make a 7-digit number bigger than one million. Swapping two identical tiles does not give a new arrangement, so we count fewer totals. A number starting with 0 is really only 6 digits, so those do not count. After removing those bad arrangements from all possible arrangements, exactly 360 valid numbers remain.

Answer: The number of numbers greater than \(1000000\) that can be formed is \(360\).

📖 Numbers Greater Than 1000000 from Given Digits

Detailed Explanation

We are given 7 digits: \(1, 2, 0, 2, 4, 2, 4\). To form a number greater than \(1000000\), we must use all 7 digits, because a 7-digit number is at least \(1000000\) and using fewer digits gives a smaller number. When we arrange objects in which some are repeated, the number of distinct arrangements is not \(7!\) but is reduced, because swapping identical objects does not create a new arrangement. Here the digit \(2\) appears 3 times and the digit \(4\) appears 2 times, so we divide by \(3!\) and \(2!\). One extra care is needed: a number cannot start with \(0\), since then it is actually a 6-digit number and not greater than \(1000000\). So we subtract the arrangements that begin with \(0\).

Formula Used

Number of arrangements of \(n\) objects where objects repeat \(p, q, \ldots\) times: \[\frac{n!}{p!\, q!\, \cdots}\]

Solution

  1. Step 1: List the digits and their repetitions. The digits are \(1, 2, 0, 2, 4, 2, 4\), a total of 7 digits. Here \(2\) occurs 3 times, \(4\) occurs 2 times, and \(1\) and \(0\) occur once each.
  2. Step 2: Find the total number of arrangements of all 7 digits. Using the formula for permutations with repetition: \[\frac{7!}{3!\, 2!}\] Compute this: \[\frac{5040}{6 \times 2} = \frac{5040}{12} = 420\] So there are 420 arrangements in total (including those starting with 0).
  3. Step 3: Remove numbers that start with \(0\), since such numbers are not greater than \(1000000\). Fix \(0\) in the first place. The remaining 6 digits to arrange are \(1, 2, 2, 4, 2, 4\), where \(2\) occurs 3 times and \(4\) occurs 2 times.
  4. Step 4: Count arrangements starting with \(0\): \[\frac{6!}{3!\, 2!} = \frac{720}{12} = 60\] So 60 of the arrangements begin with \(0\) and must be discarded.
  5. Step 5: Subtract to get the valid count: \[420 - 60 = 360\] These 360 numbers are all genuine 7-digit numbers, and every 7-digit number is greater than \(1000000\).

Final Answer

The number of numbers greater than \(1000000\) that can be formed is \(360\).

Common Mistake

A common mistake is to forget to subtract the arrangements starting with \(0\). If you leave them in, you wrongly get \(420\), but those numbers with a leading zero are only 6-digit numbers and are not greater than \(1000000\).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the digits and their frequencies: The seven digits given are \( 1, 2, 0, 2, 4, 2, 4 \). Listing each digit's frequency: digit \( 0 \) appears once, digit \( 1 \) appears once, digit \( 2 \) appears \( 3 \) times, and digit \( 4 \) appears \( 2 \) times. — Reason: Identifying repetitions is essential before applying the permutation formula, because swapping two identical digits does not produce a new number.
  2. Step 2: Determine what kind of number we need: A number greater than \( 1000000 \) must have at least 7 digits. Since we have exactly 7 digits and any 6-digit arrangement would be less than \( 1000000 \), we must use all 7 digits in every arrangement. — Reason: This confirms we count only 7-digit arrangements, so we apply the formula with \( n = 7 \).
  3. Step 3: Count ALL arrangements of the 7 digits (including those starting with 0): Applying the permutation-with-repetition formula with \( n = 7 \), \( p = 3 \) (for digit 2), and \( q = 2 \) (for digit 4): \[ \frac{7!}{3! \times 2!} \] Computing step by step: \( 7! = 5040 \), \( 3! = 6 \), \( 2! = 2 \), so \[ \frac{5040}{6 \times 2} = \frac{5040}{12} = 420 \] — Reason: This gives the total count of distinct 7-digit strings, but some begin with 0 and must be removed.
  4. Step 4: Count invalid arrangements (those starting with 0): Fix \( 0 \) in the first position. The remaining 6 digits to arrange are \( 1, 2, 2, 2, 4, 4 \), where digit \( 2 \) still appears \( 3 \) times and digit \( 4 \) still appears \( 2 \) times. The number of such arrangements is \[ \frac{6!}{3! \times 2!} \] Computing: \( 6! = 720 \), so \[ \frac{720}{6 \times 2} = \frac{720}{12} = 60 \] — Reason: Any arrangement with \( 0 \) in the leading position is effectively a 6-digit number, which is NOT greater than \( 1000000 \), so these 60 cases must be subtracted.
  5. Step 5: Subtract invalid arrangements to get the final count: Valid 7-digit arrangements \( = \) Total arrangements \( - \) Arrangements starting with \( 0 \) \[ 420 - 60 = 360 \] — Reason: Removing the cases where \( 0 \) leads ensures every counted arrangement is a genuine 7-digit number greater than \( 1000000 \).

Final Answer

The number of numbers greater than \(1000000\) that can be formed is \(360\).

Common Mistake

One common mistake: forgetting to subtract the arrangements that begin with \( 0 \). Students often compute only \( \frac{7!}{3! \times 2!} = 420 \) and report it as the answer, not realising that numbers like \( 0124224 \) are actually 6-digit numbers and must be excluded.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Digits: \ 0, 1, 2, 2, 2, 4, 4 \ (total 7). Total arrangements \ = \ \ \[ \frac{7!}{3! \cdot 2!} = \frac{5040}{12} = 420 \]
  2. Step 2: Arrangements with \ 0 \ in first place (invalid 7-digit numbers): remaining digits \ 1, 2, 2, 2, 4, 4 \ give \ \[ \frac{6!}{3! \cdot 2!} = \frac{720}{12} = 60 \]
  3. Step 3: Valid numbers \ = \ 420 \ - \ 60 \ = \ 360

Answer: The number of numbers greater than \(1000000\) that can be formed is \(360\).

➕ More Examples

More Examples

Example 1

Question: How many numbers greater than 10,00,000 (i.e., greater than 1,000,000) can be formed using the digits 3, 3, 5, 0, 5, 3, 7 (seven digits total, each used exactly once)?

Solution: We have 7 digits: 3, 3, 3, 5, 5, 0, 7. Since we must form numbers greater than 1,000,000, we need all 7-digit numbers formed using these digits. Step 1: Count the total arrangements of all 7 digits. The digits are 3 (appears 3 times), 5 (appears 2 times), 0 (appears 1 time), 7 (appears 1 time). Total arrangements (including those with leading zero): \[ \frac{7!}{3! \cdot 2! \cdot 1! \cdot 1!} \] Calculating: \[ \frac{5040}{6 \cdot 2 \cdot 1 \cdot 1} = \frac{5040}{12} = 420 \] Step 2: Subtract arrangements where 0 is the leading digit. If 0 is fixed in the first position, we arrange the remaining 6 digits: 3, 3, 3, 5, 5, 7. Arrangements with leading zero: \[ \frac{6!}{3! \cdot 2! \cdot 1!} = \frac{720}{6 \cdot 2 \cdot 1} = \frac{720}{12} = 60 \] Step 3: Valid 7-digit numbers = Total arrangements minus those with leading zero. \[ 420 - 60 = 360 \]

Answer: 360

Example 2

Question: How many numbers greater than 5,00,000 can be formed using the digits 2, 5, 5, 8, 2, 5 (six digits, each used exactly once)?

Solution: We have 6 digits: 2, 2, 5, 5, 5, 8. Numbers greater than 5,00,000 are 6-digit numbers where the leading digit is greater than 5, or the leading digit is exactly 5 (since 5,00,000 itself has 5 as the leading digit, and any 6-digit number starting with 5 using these digits is at least 5,22,258 which is greater than 5,00,000). Actually, any 6-digit number formed from these digits with a non-zero leading digit will be at least 2,25,558 or at most 8,55,522. We need those greater than 5,00,000. Case 1: Leading digit is 8. Remaining digits: 2, 2, 5, 5, 5. \[ \frac{5!}{2! \cdot 3!} = \frac{120}{2 \cdot 6} = 10 \] Case 2: Leading digit is 5. Remaining digits: 2, 2, 5, 5, 8. \[ \frac{5!}{2! \cdot 2!} = \frac{120}{2 \cdot 2} = 30 \] All numbers in Case 2 start with 5 followed by some arrangement of 2, 2, 5, 5, 8. The smallest such number is 5,22,258 and the largest is 5,88,552 — all are greater than 5,00,000. Case 3: Leading digit is 2. All such numbers are less than 3,00,000, so they are less than 5,00,000. These are excluded. Step: Total numbers greater than 5,00,000 = numbers starting with 8 + numbers starting with 5. \[ 10 + 30 = 40 \]

Answer: 40

🎯 Try a Similar Question

Try a Similar Question

Question: How many 7-digit numbers greater than 1,000,000 can be formed using the digits 3, 0, 3, 5, 3, 5, 1 (using all digits exactly once)?

Solution

  1. Step 1: Identify the digits and their frequencies: The given digits are: 0, 1, 3, 3, 3, 5, 5. So the digit 3 repeats 3 times, the digit 5 repeats 2 times, and the digits 0 and 1 each appear once. Total digits = 7.
  2. Step 2: Count all 7-digit arrangements (including those starting with 0): Total arrangements of all 7 digits (ignoring the leading-zero condition): \[ \frac{7!}{3! \cdot 2! \cdot 1! \cdot 1!} = \frac{5040}{6 \cdot 2 \cdot 1 \cdot 1} = \frac{5040}{12} = 420 \]
  3. Step 3: Subtract arrangements where the first digit is 0: If 0 is fixed in the first position, we arrange the remaining 6 digits: 1, 3, 3, 3, 5, 5. The number of such arrangements is: \[ \frac{6!}{3! \cdot 2! \cdot 1!} = \frac{720}{6 \cdot 2 \cdot 1} = \frac{720}{12} = 60 \]
  4. Step 4: Apply the condition 'greater than 1,000,000': Any 7-digit number is automatically greater than 1,000,000, provided it does not start with 0 (since a number starting with 0 would effectively be a 6-digit or smaller number). So we subtract the cases where 0 is the leading digit.
  5. Step 5: Compute the final count: Numbers greater than 1,000,000 = Total arrangements \(-\) Arrangements starting with 0: \[ 420 - 60 = 360 \] Wait — this matches the original answer. Let us re-examine with a different digit set to ensure a different answer. Using digits 3, 0, 3, 5, 3, 5, 1 is correct, but note that the original used digits 1, 2, 0, 2, 4, 2, 4. Let us recheck our digit set: 0, 1, 3, 3, 3, 5, 5 — the frequencies are the same pattern (one zero, one unique, three of one kind, two of another), so the answer is the same structurally. We therefore adjust the digit set to: 0, 2, 2, 3, 3, 3, 5 — here 3 repeats 3 times, 2 repeats 2 times, and 0 and 5 appear once each. Total arrangements: \[ \frac{7!}{3! \cdot 2! \cdot 1! \cdot 1!} = \frac{5040}{12} = 420 \] Arrangements with 0 in the first position (remaining: 2, 2, 3, 3, 3, 5): \[ \frac{6!}{3! \cdot 2! \cdot 1!} = \frac{720}{12} = 60 \] This still gives 360. We must change the repetition structure. Use digits: 0, 1, 2, 3, 3, 3, 3 — so 3 repeats 4 times, and 0, 1, 2 each appear once. Total arrangements: \[ \frac{7!}{4! \cdot 1! \cdot 1! \cdot 1!} = \frac{5040}{24} = 210 \] Arrangements with 0 first (remaining: 1, 2, 3, 3, 3, 3): \[ \frac{6!}{4! \cdot 1! \cdot 1!} = \frac{720}{24} = 30 \] Valid 7-digit numbers: \[ 210 - 30 = 180 \] This is different from 360. So the question uses digits 0, 1, 2, 3, 3, 3, 3.
  6. Step 5 (Final Corrected Computation): Using the corrected digit set 0, 1, 2, 3, 3, 3, 3 (digit 3 appears 4 times; digits 0, 1, 2 appear once each): Total 7-digit arrangements: \[ \frac{7!}{4! \cdot 1! \cdot 1! \cdot 1!} = \frac{5040}{24} = 210 \] Arrangements with 0 as the leading digit (remaining digits: 1, 2, 3, 3, 3, 3): \[ \frac{6!}{4! \cdot 1! \cdot 1!} = \frac{720}{24} = 30 \] Numbers greater than 1,000,000: \[ 210 - 30 = 180 \]

Answer: The number of 7-digit numbers greater than 1,000,000 that can be formed using the digits 0, 1, 2, 3, 3, 3, 3 is \( 180 \).

Everything you get with Solver7

More questions in Permutations and Combinations