Let S be the set of all passwords which are 6 | vedclass

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

Question

(C) The total number of characters available is $5 	ext{ (alphabets)} + 5 	ext{ (numbers)} = 10$. The number of passwords of length $n$ is $10^{n}$.

Vedclass · Accepted Answer

$7073$

Vedclass · Answer

(C) The total number of characters available is $5 	ext{ (alphabets)} + 5 	ext{ (numbers)} = 10$. The number of passwords of length $n$ is $10^{n}$. The number of passwords of length $n$ containing no numbers (i.e.,only alphabets) is $5^{n}$. The number of passwords of length $n$ with at least one number is $10^{n} - 5^{n}$. For passwords of length $6, 7,$ and $8$,the total number of such passwords is: $(10^{6} - 5^{6}) + (10^{7} - 5^{7}) + (10^{8} - 5^{8})$ $= (10^{6} + 10^{7} + 10^{8}) - (5^{6} + 5^{7} + 5^{8})$ $= 10^{6}(1 + 10 + 100) - 5^{6}(1 + 5 + 25)$ $= 10^{6}(111) - 5^{6}(31)$ $= (2^{6} 	imes 5^{6}) 	imes 111 - 5^{6} 	imes 31$ $= 5^{6} 	imes (64 	imes 111 - 31)$ $= 5^{6} 	imes (7104 - 31)$ $= 5^{6} 	imes 7073$ Given this is equal to $\alpha 	imes 5^{6}$,we find $\alpha = 7073$.

Similar Questions

An envelope has space for at most $3$ stamps. If you are given three stamps of denomination $1$ and three stamps of denomination $a$ (where $a > 1$),what is the least positive integer for which there is no possible stamp value?

If $_n{P_4} = 24 \times \binom{n}{5}$,then $n = \dots$

$A$ question paper is divided into two parts $A$ and $B$,and each part contains $5$ questions. The number of ways in which a candidate can answer $6$ questions,selecting at least two questions from each part,is:

If a five-digit number divisible by $3$ is to be formed using the digits $0, 1, 2, 3, 4,$ and $5$ without repetition,then the total number of ways this can be done is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module