• edited by
658 views
0 0 votes

A password contains exactly $6$ characters. Each character is either a lowercase letter $\{a,b,\dots,z\}$ or a digit $\{ 0,1,\dots,9\}$. A valid password should contain at least one digit. What is the total number of valid passwords?

  1. Here is an incorrect answer to the above question. Find the flaw in the argument. Let $P_i$ denote the number of passwords where the $i-th$ character is a digit, for $i\;\in \;1,\dots,6$.

$$P_1=10\cdot(36)^5$$

$$P_2=36\cdot 10\cdot(36)^4$$

$$\dots$$

$$P_6=(36)^5\cdot 10$$

Therefore, total number of valid passwords is $6\cdot 10\cdot (36)^5$ (the sum of the right hand sides above).

  1. What is the correct answer? Provide a justification for your answer. You do not need to simplify your expressions (for example, you can write $26^5, 5!, etc.$).

2 Answers

0 0 votes

Here is the solution, since they asked about password should contains at least 1 digit, which means it contains 1,2,3,4,5 or 6 digits

so we 1st find all passwords  which contains both alphabets as well as digits on that we remove passwords which contains only alphabets, then we will get required answer 

Position:
Show:

Related questions

0 0 votes
1 1 answer
364
364 views
soujanyareddy13 asked Jan 28, 2021
364 views
There are two cities, City $X$ and City $Y$. Each city has a metro system consisting of three different lines – red line, blue line, and green line. Each station (in both...
0 0 votes
1 1 answer
365
365 views
soujanyareddy13 asked Jan 28, 2021
365 views
A graph is finite if it has a finite number of vertices, and simple if it has no self-loops or multiple edges. Assume we are dealing with finite, undirected, simple graph...
0 0 votes
1 1 answer
313
313 views
soujanyareddy13 asked Jan 28, 2021
313 views
A graph is finite if it has a finite number of vertices, and simple if it has no self-loops or multiple edges.Prove or disprove: There exists a finite, undirected, simple...
0 0 votes
1 1 answer
356
356 views
soujanyareddy13 asked Jan 28, 2021
356 views
Consider the procedure $\text{MYSTERY}$ described in pseudocode below. The procedure takes two non-negative integers as arguments. For a real number $x$ the notation $[x]...