Numbers greater than 1000 but not greater tha | vedclass

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

Question

(B) The numbers must be $4$-digit numbers since they are between $1000$ and $4000$.Let the $4$-digit number be represented as $d_1 d_2 d_3 d_4$.For th

Vedclass · Accepted Answer

$375$

Vedclass · Answer

(B) The numbers must be $4$-digit numbers since they are between $1000$ and $4000$.Let the $4$-digit number be represented as $d_1 d_2 d_3 d_4$.For the number to be greater than $1000$ and less than or equal to $4000$,the first digit $d_1$ can be $1, 2, 3,$ or $4$.Case $1$: If $d_1 = 1, 2,$ or $3$,then each of the remaining three positions $(d_2, d_3, d_4)$ can be filled by any of the $5$ digits $(0, 1, 2, 3, 4)$ in $5$ ways each.Number of such integers = $3 	imes 5 	imes 5 	imes 5 = 375$.However,this includes the number $1000$ (where $d_1=1, d_2=0, d_3=0, d_4=0$). Since the question asks for numbers strictly greater than $1000$,we must exclude $1000$.So,count = $375 - 1 = 374$.Case $2$: If $d_1 = 4$,the only number possible is $4000$ because any other combination like $4001$ would be greater than $4000$.Thus,we add $1$ for the number $4000$.Total numbers = $374 + 1 = 375$.

Numbers greater than $1000$ but not greater than $4000$ which can be formed with the digits $0, 1, 2, 3, 4$ (repetition of digits is allowed),are

Similar Questions

$A$ number lock on a suitcase has $3$ wheels,each labelled with $10$ digits from $0$ to $9$. If opening the lock requires a particular sequence of $3$ digits with no repeats,how many such sequences are possible?

There are $10$ different letters of the English alphabet. If words of $5$ letters are formed using these letters,how many words can be formed such that at least one letter is repeated?

The letters of the word $MODESTY$ are written in all possible orders and these words are written out as in a dictionary,then the rank of the word $MODESTY$ is

If $x, y$ and $r$ are positive integers, then $^x{C_r} + ^x{C_{r-1}} \cdot ^y{C_1} + ^x{C_{r-2}} \cdot ^y{C_2} + \dots + ^y{C_r} = $

Out of $13$ cricket players,$4$ are bowlers. In how many ways can a cricket team of $11$ players be formed such that at least $2$ bowlers are included?

Vedclass Test Series

Exam Paper Generator

Online Exam Module