The number of odd numbers greater than 6,00,0 | vedclass

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

Question

(B) We need to form $6$-digit numbers greater than $6,00,000$ using the digits $\{0, 3, 6, 7, 8, 9\}$ without repetition. For the number to be odd,the

Vedclass · Accepted Answer

$240$

Vedclass · Answer

(B) We need to form $6$-digit numbers greater than $6,00,000$ using the digits $\{0, 3, 6, 7, 8, 9\}$ without repetition. For the number to be odd,the last digit must be $3, 7,$ or $9$ ($3$ choices). For the number to be greater than $6,00,000$,the first digit must be $6, 7, 8,$ or $9$. Case $1$: The first digit is $6$ or $8$ ($2$ choices). The last digit is $3, 7,$ or $9$ ($3$ choices). The remaining $4$ positions can be filled by the remaining $4$ digits in $4! = 24$ ways. Number of ways $= 2 	imes 24 	imes 3 = 144$. Case $2$: The first digit is $7$ or $9$ ($2$ choices). The last digit must be one of the remaining $2$ odd digits ($2$ choices). The remaining $4$ positions can be filled by the remaining $4$ digits in $4! = 24$ ways. Number of ways $= 2 	imes 24 	imes 2 = 96$. Total number of odd numbers $= 144 + 96 = 240$.

The number of odd numbers greater than $6,00,000$ that can be formed by using the digits $3, 6, 7, 8, 9, 0$ without repetition is

Similar Questions

The total number of $4$-digit numbers which can be formed using the digits $1, 2, 3, 4$ without repetition such that the digit $n+1$ never immediately follows the digit $n$ is:

The number of ways in which $5$ boys and $3$ girls can be seated in a row so that each girl is between two boys.

If all the letters of the word $MASTER$ are permuted in all possible ways and the words (with or without meaning) thus formed are arranged in dictionary order,then the rank of the word $MASTER$ is

$A$ vehicle registration number consists of $2$ letters of the English alphabet followed by $4$ digits, where the first digit is not zero. The total number of vehicles with distinct registration numbers is

In how many ways can the letters of the word $ASSASSINATION$ be arranged so that all the $S$'s are together?

Vedclass Test Series

Exam Paper Generator

Online Exam Module