Home
Class 12
MATHS
Consider seven digit number x1,x2,...,x7...

Consider seven digit number `x_1,x_2,...,x_7,` where `x_1,x_2,..,x_7 != 0` having the property that `x_4` is the greatest digit and digits towards the left and right of `x_4` are in decreasing order. Then total number of such numbers in which all digits are distinct is

A

`""^(9)C_(7)*""^(6)C_(3)`

B

`""^(9)C_(5)+2""^(9)C_(4)`

C

`3""^(9)C_(4)`

D

`378`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of finding the total number of seven-digit numbers \( x_1, x_2, \ldots, x_7 \) such that all digits are distinct, none of the digits are zero, \( x_4 \) is the greatest digit, and the digits to the left and right of \( x_4 \) are in decreasing order, we can follow these steps: ### Step 1: Identify the possible values for \( x_4 \) Since \( x_4 \) is the greatest digit and must be one of the digits from 1 to 9 (as none of the digits can be zero), we can choose \( x_4 \) from the set \( \{1, 2, 3, 4, 5, 6, 7, 8, 9\} \). ### Step 2: Choose the digits for \( x_4 \) Let’s denote the value of \( x_4 \) as \( d \). Since \( d \) is the greatest digit, it can take any value from 1 to 9. We will have 9 choices for \( d \). ### Step 3: Select the remaining digits After choosing \( d \) for \( x_4 \), we need to select 6 more distinct digits from the remaining digits (which are from 1 to 9 excluding \( d \)). This gives us \( 8 \) remaining digits to choose from. ### Step 4: Choose 6 digits from the remaining 8 We need to choose 3 digits for the left side of \( x_4 \) (which will be \( x_1, x_2, x_3 \)) and 3 digits for the right side of \( x_4 \) (which will be \( x_5, x_6, x_7 \)). The number of ways to select 6 digits from the 8 remaining digits is given by \( \binom{8}{6} \) or equivalently \( \binom{8}{2} \). ### Step 5: Arrange the selected digits Once we have selected the 6 digits, we need to arrange them in decreasing order. Since the digits on the left of \( x_4 \) must be in decreasing order, we can simply arrange the 3 digits chosen for the left side in 1 way (as they must be in decreasing order). The same applies to the 3 digits chosen for the right side. ### Step 6: Calculate the total combinations Putting it all together, the total number of distinct seven-digit numbers can be calculated as follows: \[ \text{Total Numbers} = \text{Choices for } x_4 \times \text{Ways to choose 6 digits} \] \[ = 9 \times \binom{8}{6} = 9 \times \binom{8}{2} \] \[ = 9 \times \frac{8 \times 7}{2 \times 1} = 9 \times 28 = 252 \] ### Final Answer Thus, the total number of such seven-digit numbers is **252**. ---
Promotional Banner

Topper's Solved these Questions

  • PERMUTATION & COMBINATION

    VMC MODULES ENGLISH|Exercise JEE ARCHIVE|50 Videos
  • PERMUTATION & COMBINATION

    VMC MODULES ENGLISH|Exercise LEVEL-1|125 Videos
  • MOCK TEST 9

    VMC MODULES ENGLISH|Exercise MATHEMATICS (SECTION 2)|5 Videos
  • PROBABILITY

    VMC MODULES ENGLISH|Exercise JEE ADVANCED (ARCHIVE)|102 Videos

Similar Questions

Explore conceptually related problems

The total number of 9 digit numbers which have all different digits is

The total number of 9-digit number which have all different digits is

The total number of 4 digit numbers in which the digit are in descending order, is

Write the greatest 7-digit number having three different digits.

Write the greatest 7-digit number having three different digits.

Total number of 6 digits numbers in which only and all the four digits 1, 2, 3, 4 appear, is:

Write the greatest five-digit number using the digits 4, 2 and 0.

A three digit number is chosen, what is the probability of having digits in increasing order from left to right .

Consider all the 5 digit numbers where each of the digits is chosen from the set { 1, 2, 3, 4} . Then the number of numbers, which contain all the four digits is :

Make the greatest and the smallest: 4-digit numbers with the digit 4,1,0 using any one digit twice.

VMC MODULES ENGLISH-PERMUTATION & COMBINATION-LEVEL-2
  1. P=n(n^(2)-1)(n^(2)-4)(n^(2)-9)…(n^(2)-100) is always divisible by , (...

    Text Solution

    |

  2. Let n be a positive integer and define f(n)=1!+2!+3!+…+n!. Find polyno...

    Text Solution

    |

  3. Consider seven digit number x1,x2,...,x7, where x1,x2,..,x7 != 0 havin...

    Text Solution

    |

  4. A woman has 11 close friends. Number of ways in which she can invite 5...

    Text Solution

    |

  5. On the normal chess board as shown, I1, & I2, are two insects whic...

    Text Solution

    |

  6. There are 12 points in a plane of which 5 are collinear. The maximum n...

    Text Solution

    |

  7. There are 10 seats in the first row of a theatre of which 4 are to be ...

    Text Solution

    |

  8. A man is at the origin on the x-axis and takes a unit step either to t...

    Text Solution

    |

  9. For the equation x + y + z +omega= 19, the number of positive integral...

    Text Solution

    |

  10. Find the number of non-negative integral solutions of x1+x2+x3+4x4=20.

    Text Solution

    |

  11. 10 persons are to be arranged in a circular fashion so that in no two ...

    Text Solution

    |

  12. The Number of ways in which five different books to be distributed amo...

    Text Solution

    |

  13. Number of ways in which the letters of the word ‘B U L B U L’ can be a...

    Text Solution

    |

  14. Number of ways in which 200 people can be divided in 100 couples is -

    Text Solution

    |

  15. If letters of the word “THING” are arranged in all possible manner and...

    Text Solution

    |

  16. You are given 8 balls of different colour (black,white ......). The nu...

    Text Solution

    |

  17. Kanchan has 10 friends among whom two are married to each other. Sh...

    Text Solution

    |

  18. Number of quadrilaterals which can be constructed by joining the verti...

    Text Solution

    |

  19. There are n married couples at a party. Each person shakes hand with e...

    Text Solution

    |

  20. There are 25 students in a class. The teacher takes 5 of them at a tim...

    Text Solution

    |