Assuming that no two consecutive digits are s | vedclass

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

Question

(A) For an $n$-digit number,the first digit (at the leftmost position) can be any digit from $1$ to $9$ (since it cannot be $0$). Thus,there are $9$ c

Vedclass · Accepted Answer

$9 	imes 9^{n-1}$

Vedclass · Answer

(A) For an $n$-digit number,the first digit (at the leftmost position) can be any digit from $1$ to $9$ (since it cannot be $0$). Thus,there are $9$ choices for the first digit.For the second digit,it can be any digit from $0$ to $9$ except the one used for the first digit. Thus,there are $9$ choices for the second digit.For the third digit,it can be any digit from $0$ to $9$ except the one used for the second digit. Thus,there are $9$ choices for the third digit.Continuing this pattern,for each subsequent position up to the $n$-th digit,there are always $9$ choices available because each digit only needs to be different from the one immediately preceding it.Therefore,the total number of $n$-digit numbers is $9 	imes 9 	imes 9 	imes \dots 	imes 9$ ($n$ times),which equals $9 	imes 9^{n-1}$.

Assuming that no two consecutive digits are same,the number of $n$-digit numbers is:

Similar Questions

If $^8C_r = ^8C_{r+2}$,then the value of $^rC_2$ is

If $12 \cdot {}^{n}C_{2} = {}^{2n}C_{3}$,find $n$.

How many numbers can be formed using the digits $0, 1, 2, 3, 4, 5$ that are greater than $3000$ (repetition is not allowed)?

There are $10$ persons named $A, B, \dots, J$. We have the capacity to accommodate only $5$. In how many ways can we arrange them in a line if $A$ must be included and $G$ and $H$ must not be included in the team of $5$?

$A$ dictionary is printed consisting of $7$-letter words only that can be formed using the letters of the word $CRICKET$. If the words are arranged in alphabetical order,as in an ordinary dictionary,then the number of words before the word $CRICKET$ is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module