All the five-digit numbers in which each succ | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) five-digit number with strictly increasing digits is uniquely determined by choosing $5$ distinct digits from the set ${1, 2, 3, 4, 5, 6, 7, 8, 9}

Vedclass · Accepted Answer

$5$

Vedclass · Answer

(B) five-digit number with strictly increasing digits is uniquely determined by choosing $5$ distinct digits from the set ${1, 2, 3, 4, 5, 6, 7, 8, 9}$. The digit $0$ cannot be used because the digits must be strictly increasing,and $0$ would have to be the first digit,which is not allowed for a five-digit number.Total such numbers = $^9C_5 = 126$.Numbers starting with $1$: We need to choose $4$ more digits from ${2, 3, 4, 5, 6, 7, 8, 9}$.Number of such numbers = $^8C_4 = 70$.Numbers starting with $2$: We need to choose $4$ more digits from ${3, 4, 5, 6, 7, 8, 9}$.Numbers starting with $23$: We choose $3$ more digits from ${4, 5, 6, 7, 8, 9}$.Number of such numbers = $^6C_3 = 20$.Cumulative count so far = $70 + 20 = 90$.Numbers starting with $24$:Numbers starting with $245$: We choose $2$ more digits from ${6, 7, 8, 9}$.Number of such numbers = $^4C_2 = 6$.Cumulative count = $90 + 6 = 96$.The $97^{th}$ number is the first number starting with $246$. The digits must be strictly increasing,so the next digits must be $7$ and $8$.The $97^{th}$ number is $24678$.This number does not contain the digit $5$.

All the five-digit numbers in which each successive digit exceeds its predecessor are arranged in the increasing order of their magnitude. The $97^{th}$ number in the list does not contain the digit:

Similar Questions

Number of different words that can be formed from all letters of the word $APPLICATION$ such that two vowels never come together is -

All the letters of the word '$EAMCET$' are arranged in all possible ways. The number of such arrangements in which two vowels are not adjacent to each other is

How many words (with or without meaning) of $3$ distinct English alphabets can be formed?

How many words can be formed by using all the letters of the word '$TRIVANDRUM$' using each letter exactly once (in $!$)?

The number of straight lines that can be formed by joining $8$ points on a circle is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module