Sign in
12thPass logo
New chatPYQ LibraryDoubtsRank report
Sign in to see Recents

Your guest activity stays on this device

Sign in to save progress →
Sign in

Permutations and Combinations question

2025 · Shift 1 · Q26
Guest · filters and generic practice availableBrowsing as a guest · PYQ filters and generic practice are available. Sign in only for personalised features and saved progress.
  1. PYQ Library
  2. /JEE Advanced
  3. /Mathematics
  4. /Permutations and Combinations
  5. /2025 · Shift 1 · Q26

Permutations and Combinations question

2025 · Shift 1 · Q26

JEE AdvancedMathematicsPermutations and CombinationsNumerical+4 / −1
Let SSS be the set of all seven-digit numbers that can be formed using the digits 0,10, 10,1 and 222. For example, 221022222102222210222 is in SSS, but 021022202102220210222 is NOT in SSS. Then the number of elements xxx in SSS such that at least one of the digits 000 and 111 appears exactly twice in xxx, is equal to ‾\underline{\hspace{2cm}}​.
Numerical answer
View written solutionFree

Correct answer: 762

We need to count seven-digit numbers formed from digits 0,1,20,1,20,1,2 such that:

  • the first digit is not 000,
  • and at least one of the digits 000 and 111 appears exactly twice.

Let:

  • AAA = set of valid seven-digit numbers where digit 000 appears exactly twice,
  • BBB = set of valid seven-digit numbers where digit 111 appears exactly twice.

We want: ∣A∪B∣=∣A∣+∣B∣−∣A∩B∣.|A \cup B| = |A| + |B| - |A \cap B|.∣A∪B∣=∣A∣+∣B∣−∣A∩B∣.


1. Count ∣A∣|A|∣A∣: digit 000 appears exactly twice

A 7-digit number cannot start with 000, so the two zeroes must be placed among the last 6 positions.

Number of ways to choose positions of the two zeroes: (62)=15.\binom{6}{2} = 15.(26​)=15.

The remaining 5 positions can each be filled with either 111 or 222: 25=32.2^5 = 32.25=32.

Hence, ∣A∣=(62)⋅25=15⋅32=480.|A| = \binom{6}{2} \cdot 2^5 = 15 \cdot 32 = 480.∣A∣=(26​)⋅25=15⋅32=480.


2. Count ∣B∣|B|∣B∣: digit 111 appears exactly twice

Now we count 7-digit numbers where exactly two digits are 111.

Since 111 can appear anywhere, first choose the 2 positions for the digit 111: (72)=21.\binom{7}{2} = 21.(27​)=21.

The remaining 5 positions are to be filled with 000 or 222, but the first digit of the whole number cannot be 000.

So we split into cases.

Case 1: First position is one of the chosen positions for digit 111

Then the first digit is automatically nonzero.

Choose the other position of 111 from the remaining 6 positions: (61)=6.\binom{6}{1} = 6.(16​)=6.

The remaining 5 positions can be filled with 000 or 222 freely: 25=32.2^5 = 32.25=32.

Count: 6⋅32=192.6 \cdot 32 = 192.6⋅32=192.

Case 2: First position is not a position of digit 111

Then both 111's are among the last 6 positions: (62)=15.\binom{6}{2} = 15.(26​)=15.

Now among the remaining 5 positions, the first digit must be 222 (cannot be 000), and the other 4 positions can be 000 or 222: 1⋅24=16.1 \cdot 2^4 = 16.1⋅24=16.

Count: 15⋅16=240.15 \cdot 16 = 240.15⋅16=240.

Thus, ∣B∣=192+240=432.|B| = 192 + 240 = 432.∣B∣=192+240=432.


3. Count ∣A∩B∣|A \cap B|∣A∩B∣: both 000 and 111 appear exactly twice

We need numbers with:

  • exactly two 000's,
  • exactly two 111's,
  • therefore the remaining three digits are 222's.

Again, since the first digit cannot be 000, count by cases.

Case 1: First digit is 111

Then we need:

  • one more 111 among the remaining 6 positions,
  • two 000's among the remaining 6 positions,
  • the rest are 222's.

Choose position of the second 111: (61)=6.\binom{6}{1} = 6.(16​)=6.

Choose positions of the two zeroes from remaining 5 positions: (52)=10.\binom{5}{2} = 10.(25​)=10.

Count: 6⋅10=60.6 \cdot 10 = 60.6⋅10=60.

Case 2: First digit is 222

Then among the remaining 6 positions, choose:

  • two positions for 000,
  • two positions for 111,
  • remaining two are 222.

Choose positions of two zeroes: (62)=15,\binom{6}{2} = 15,(26​)=15, then positions of two ones from remaining 4: (42)=6.\binom{4}{2} = 6.(24​)=6.

Count: 15⋅6=90.15 \cdot 6 = 90.15⋅6=90.

Therefore, ∣A∩B∣=60+90=150.|A \cap B| = 60 + 90 = 150.∣A∩B∣=60+90=150.


4. Apply inclusion-exclusion

∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B|∣A∪B∣=∣A∣+∣B∣−∣A∩B∣ =480+432−150= 480 + 432 - 150=480+432−150 =762.= 762.=762.


Final Answer

The required number of elements is 762.\boxed{762}.762​.

This matches the stored correct answer.

PreviousNext

More from Permutations and Combinations

  • A group of 9 students, s1​,s2​,…,s9​, is to be divided to form three teams X,Y, and Z of sizes 2,3 , and 4 , respectively. Suppose that s1​ cannot be selected for the team X, and s2​ cannot be selected for the team…2024 · Numerical
  • Let S={1,2,3,4,5,6} and X be the set of all relations R from S to S that satisfy both the following properties: i. R has exactly 6 elements. ii. For each (a,b)∈R, we have ∣a−b∣≥2. Let Y={R∈X: The range of…2024 · Numerical
  • Let S={1,2,3,4,5,6} and X be the set of all relations R from S to S that satisfy both the following properties: i. R has exactly 6 elements. ii. For each (a,b)∈R, we have ∣a−b∣≥2. Let Y={R∈X: The range of…2024 · Numerical
  • The number of 4-digit integers in the closed interval [2022, 4482] formed by using the digits 0,2,3,4,6,7 is ​.2022 · Numerical
  • Consider 4 boxes, where each box contains 3 red balls and 2 blue balls. Assume that all 20 balls are distinct. In how many different ways can 10 balls be chosen from these 4 boxes so that from each box at least one red ball and one blue…2022 · MCQ
  • Let S1​={(i,j,k):i,j,k∈{1,2,....,10}}, S2​={(i,j):1≤i<j+2≤10,i,j∈{1,2,...,10}}, S3​={(i,j,k,l):1≤i<j<k<l,i,j,k,l∈{1,2,...,10}}…2021 · Multiple correct
  • An engineer is required to visit a factory for exactly four days during the first 15 days of every month and it is mandatory that no two visits take place on consecutive days. Then the number of all possible ways in which such visits to…2020 · Numerical
  • In a hotel, four rooms are available. Six persons are to be accommodated in these four rooms in such a way that each of these rooms contains at least one person and at most two persons. Then the number of all possible ways in which this…2020 · Numerical