• edited by
29,487 views
76 76 votes

Given digits $ 2, 2, 3, 3, 3, 4, 4, 4, 4$ how many distinct $4$ digit numbers greater than $3000$ can be formed?

  1. $50$
  2. $51$
  3. $52$
  4. $54$

12 Answers

Best answer
158 158 votes

first place should be occupied by either $3$ or $4.$

Case 1 : First place is occupied by the digit $4$ 
 $4$  _  _  _
now in the set from where we can pick numbers is left with $=\{2,2,3,3,3,4,4,4\} $
if we got $3$ of each digit(which are $2, 3$ and $4$) then number of ways by each of those blanks can be

filled in are $3$ coz we have $3$ choices of digits: $\text{pick } 2, 3$ or $4.$
But we do not have just enough $2's$ to fill all those $3$ spaces with the digit $2.$

$\therefore$ we need to subtract this case where number would be $4222$.
So, total numbers obtained using the numbers in our current set $=1 \times 3 \times 3 \times 3 - 1 = 26$.

The first one is for the digit $4,$ coz its fixed for this case; the subtracted one is for the case $4222$ that can't be made possible.

Case 2: First place is occupied by the digit $3$ 
$3$  _  _  _
now in the set from where we can pick numbers is left with $=\{2,2,3,3,4,4,4,4\}$
we have enough $4's$ here but lack $3's$ and $2's$ $\therefore$, the cases we need to subtract are $3222$ and $3333$
So, total numbers obtained using the numbers in our current set $=1 \times 3 \times 3 \times 3 - 2 = 25$

both cases are independently capable of giving us the answer, we have =$ 26 + 25 = 51.$

Hence answer is option B.

• edited by
32 32 votes

Answer is B 

Let first digit is 3 now rest 3 digits can be from 2,2,3,3,4,4,4,4 but in this no of 2's and 3's are only 2 so 222 and 333 is not possible so the possible no 3*3*3 -2 = 25

In second condition the First no is 4 now rest three digits can be 2,2,3,3,3,4,4,4 so here no of 2's is also two so possible numbers is 3*3*3* -1=26

25+26=51

6 6 votes
answer - B

first digit can be 3 or 4

permutations for remaining 3 places as follows

no digit repeated = 3!

one digit repeated = 3!/2!

non repeating digit can be chosen in 2 ways = (3!/2!)2

repeating digit can be chosen in 3 ways = ((3!/2!)2)3

numbers greater than 3000 but less than 4000 = 3! + ((3!/2!)2)3  = 24 + 1(only 4 can be repeated 3 times

numbers grater than 4000 = 3! + ((3!/2!)2)3  + 2 (since 4 and 3 can be repeated 3 times) = 26

total numbers = 51
• edited by
2 2 votes

Answer: Option B

Explanation:

The given digits are 2, 2, 3, 3, 3, 4, 4, 4, 4 we have to find the numbers that are greater than 300

∴ The first digit can be 3 or 4 but not 2.

Now, let us fix the first, second and third digits as 3, 2, 2, then the fourth place can be filled in 3 ways.

∴ The number of ways is 3 similarly, we fix first third and fourth place as 3, 2 and 2 respectively (4) so the second place can be filled in 3 ways again,

The number of ways is 3

Now, we fix first, second and fourth, previous cases and we obtain the same result.

∴ The number of ways is 3 so, the total number of ways is 9 similarly this can done by fixing the numbers as 3 and 4 (instead of 2) and thereby we obtain the a ways each

The number of numbers starting with 3 is 27

Similarly by taking 4 as the first digit we get 27 numbers

∴ The number of numbers that are greater than 3000 is 27 + 27 = 54

But, 3222, 4222, is not possible as there are only two 2's, 3333 is not possible as there are only three 3's

∴ The total number of numbers that are greater than 3000 is 54 - 3 = 51

Hope it helps u.:)

2 2 votes
3 _ _ _

 

Filling with 2 3's

3 3 3 _

last place can be filled by a 2

this number can be altered in 3!/2! ways keeping the thousands place intact

last place can be filled by a 2

this number can be altered in 3!/2! ways keeping the thousands place intact

last place can be filled by a 4

this number can be altered in 3!/2! ways keeping the thousands place intact

so far 3+3

 

3 _ _ _

3 3 _ _

Two 2's in the gap →3!/2!

Two 4's in the gap→3!/2!

one two and one 4→3!

3+3+6=12

 

3_ _ _

3 2 _ _

Gaps can be filled by a two and a four →3!/2!

Gaps can be filled by 2 4's→3!/2!

3+3=6

 

3_ _ _

Filling all the gaps by 4→1 way only

 

3 3 3 2 3

3 3 3 4 3

3 3 2 2 3

3 3 4 4 3

3 3 2 4 6

3 2 2 4 3

3 2 4 4 3

3 4 4 4 1

so starting with 3 we have 6+12+6+1=25ways

 

4 _ _ _

4 4 4 4→1

 

4 3 4 4→3

4 3 2 4→6

4 3 2 2→3

4 3 3 2→3

4 3 3 4→3

4 3 3 3→1

 

4 2 4 4→3

4 2 3 4(counted)

4 2 3 3(counted)

4 2 2 4→3

4 2 2 3 (counted)

total 26 ways

 

51 ways total

 

Alternative approach:(Error prone)

 

Starting with 3 we have to fill 3 more spots

Consider each spot has 3 ways

3*3*3=27 ways but 3222 and 3333 not possible so subtract 2

25 ways

 

Starting with 4 we have 27 ways but 4222 is not possible so subtract 1

it's 26 ways
Answer:
Position:
Show:

Related questions

27 27 votes
3 answers 3 answers
12.4k
12.4k views
go_editor asked Sep 30, 2014
12,438 views
$5$ skilled workers can build a wall in $20$ days; $8$ semi-skilled workers can build a wall in $25$ days; $10$ unskilled workers can build a wall in $30$ days. If a team...
51 51 votes
6 answers 6 answers
13.6k
13.6k views
Misbah Ghaya asked Nov 29, 2016
13,619 views
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
43 43 votes
6 answers 6 answers
17.1k
17.1k views
Kathleen asked Sep 23, 2014
17,073 views
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
51 51 votes
8 answers 8 answers
17.5k
17.5k views
Kathleen asked Sep 14, 2014
17,516 views
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetiti...