• edited by
29,935 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

2 2 votes

SIMPLEST METHOD (This is how you should solve in GATE )


Assume an unlimited supply of 2, 3, and 4.

For the number to be greater than 3000, the first digit must be either 3 or 4.

  • First digit = 3:

     
    3 _ _ _

    Remaining three positions each have 3 choices ⇒  3^3 =  27

  • First digit = 4:

     
    4 _ _ _

    Again, 3^3 =  27

Thus,

 
Total = 27 + 27 = 54

But there are not unlimited 2,3 and 4. 
 

Available digits are:

  • two 2's,
     
  • three 3's,
     
  • four 4's.
     

Since a 4-digit number cannot use more than four 4's, only the following invalid numbers were
 overcounted:

  • 3222 (using three 2's when only two 2's available)
     
  • 4222(using three 2's when only two 2's available)
     
  • 3333(using four 3's when only three 3's available)

     

Hence,

54 − 3 = 51
1 1 vote

Numbers are 2,2,3,3,3,4,4,4,4

As it is 4 digit number first place must be 3,or 4

If 1st place is 3

2nd place can be fill up from any of rest 8 numbers.

3rd place can be fill up with any of rest 7 numbers

4 th place can be fill up with any of rest 6 numbers

So, total numbers $8\times 7\times 6=336$

If 1st place is 4

Similarly it also can be fill with 336 numbers

So, total $2\times 336$=672

1 1 vote

For the case of the Number greater than 3000
Let us make the choice form where :-

1st Position has 2 choices to make from (3 or 4)

2nd Position has 3 choices to make form (2 or 3 or 4)

3rd Position has 3 choices to make form (2 or 3 or 4)

4th Position has 3 choices to make form (2 or 3 or 4)

 

Hence total of 2*3*3*3 = 54 Choices 
But here we have done a mistake as it can include number such as 4222, 3222 and 3333. So we need to subtract these. 

Hence net resultant will be = 54-3 = 51 Choices. 

0 0 votes
Greater than 3000
⇒ First digit: 3 or 4
(i) First digit - 3:
We have to choose 3 digits from (2, 2, 3, 3, 4, 4, 4, 4).
Any place can have either 2 or 3 or 4, but (222, 333) is not possible as we have only two 2's and two 3's.
Total = 3 × 3 × 3 - 2 = 25
(ii) First digit - 4:
We have to choose 4 digits from (2, 2, 3, 3, 4, 4, 4, 4).
Any place can have either 2 or 3 or 4, but (222) is not possible we have only two 2's.
Total = 3 × 3 × 3 - 1 = 26
∴ Total number possible = 25 + 26 = 51
0 0 votes

_ _ _ _

Left Most Spot (LMS) can have either 3 or 4 for a number to be greater than 3000

Case 1: Leftmost is 4

SS = {2,2,3,3,3,4,4,4}

The remaining 3 spots can be filled –

_ _ _ _

For green marked spots

Leftmost → taken by 4 → remaining 2 spots can be filled in 9 ways {2,3,4}

Leftmost → taken by 3 → remaining 2 can be filed in 9 ways {2,3,4}

Leftmost → taken by 2 → Middle spot taken by 2 → Last spot can be filled in 2 ways by {3,4}

                                          Middle spot taken by {3,4}  → Last spot can be taken in 3 ways twice by {2,3,4}

Total cases = 9 + 9 + 2 + 2(3) = 26

Case 2: Leftmost is 3

_ _ _ _

SS = {2,2,3,3,4,4,4,4}

_ _ _ _

Leftmost → taken by 4 → Remaining 2 spots can be filled in 9 ways

Leftmost → taken by 3 → Middle spot taken by 3 → Last spot can be taken in 2 ways

                                     → Middle spot taken by {2,4} → Last spot can be taken in 3 ways twice by {2,3,4}

Leftmost → taken by 2 → Middle spot taken by 2 → Last spot can be taken in 2 ways

                                      → Middle spot taken by {3,4} → Last spot can be taken in 3 ways twice by {2,3,4}

Total numbers = 9 + 2 + 6 + 2 + 6 = 25

→ Total distinct numbers = 25 + 26 = 51

Answer:
Position:
Show:

Related questions

27 27 votes
3 answers 3 answers
12.6k
12.6k views
go_editor asked Sep 30, 2014
12,565 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.9k
13.9k views
Misbah Ghaya asked Nov 29, 2016
13,908 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.5k
17.5k views
Kathleen asked Sep 23, 2014
17,468 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
18.0k
18.0k views
Kathleen asked Sep 14, 2014
18,008 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...