Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (anonymous):

password question, need some help..

OpenStudy (anonymous):

OpenStudy (anonymous):

a) Let's try first by calculating the total number of passwords without requirements, and then subtracting the total number of passwords which DON'T meet the requirements.

OpenStudy (anonymous):

Cinar, can you do this?

OpenStudy (anonymous):

62^10

OpenStudy (anonymous):

that is total only..

OpenStudy (anonymous):

Now how many don't meet the 'at least one digit' rule, how many don't meet the 'at least one lower case letter', and how many don't meet the 'at least one upper case letter' requirement?

OpenStudy (anonymous):

10^52+10^36+10^36

OpenStudy (anonymous):

listen I'll be right back ok, give me couple minutes, I need to do something..

OpenStudy (anonymous):

\( (26 +26)^{10}\) Have no digit \( (26+10)^{10} \) Have no lower case \((26+10)^{10} \) Have no upper case

OpenStudy (anonymous):

We still double count the ones who break two or more rules, so we have to get rid of them. \(10^{10} \) break both upper and lower case rule \(26^{10} \) break both upper case and digit rule \(26^{10} \) break both lower case and digit rule \(0\) break all three rules, because it must contain at least a digit or letter

OpenStudy (anonymous):

you'are right, I made a typo..

OpenStudy (anonymous):

So we have \((10+26+26)^{10} - ((10+26)^{10} + (10+26)^{10} + (26+26)^{10} - (10^{10} + 26^{10} + 26^{10})) \)

OpenStudy (anonymous):

Do you understand how I did that?

OpenStudy (anonymous):

hold on..

OpenStudy (anonymous):

it is like union of three set..

OpenStudy (anonymous):

Yeah

OpenStudy (anonymous):

Are you doing probability with set theory?

OpenStudy (anonymous):

Discreet math?

OpenStudy (anonymous):

Discreet math

OpenStudy (anonymous):

So do you or don't you understand how I got what I got?

OpenStudy (anonymous):

so, AUBUC=A+B+C-AIB-AIC-BIC+AIBIC I=intersection

OpenStudy (anonymous):

Yeah

OpenStudy (anonymous):

got it..

OpenStudy (anonymous):

how about part b, any idea..

OpenStudy (anonymous):

Do you have any ideas where to start?

OpenStudy (anonymous):

let see

OpenStudy (anonymous):

preceded by a letter means a1 or 1a

OpenStudy (anonymous):

I am confused..

OpenStudy (anonymous):

I'm pretty sure it means a1

OpenStudy (anonymous):

hmm, then password cannot be begun by a number..

OpenStudy (anonymous):

Well, one thing to ask is, must all digits be preceded by a number, or just at least one digit?

OpenStudy (anonymous):

and also no number is successive

OpenStudy (anonymous):

22 or 555 not allowed

OpenStudy (anonymous):

a2ddd3y8jj8i898 is ok

OpenStudy (anonymous):

I think a123456789 is also okay, because it has one digit immediately preceded by a letter. They didn't say ALL must follow the rule, just one.

OpenStudy (anonymous):

so 1a23456789 would be ok too.

OpenStudy (anonymous):

that' why I am confused..

OpenStudy (anonymous):

listen I need some break to eat something..

OpenStudy (anonymous):

I am back..

OpenStudy (anonymous):

Ok. So one thing we can take into consideration is that for a password to have a digit and be invalid, it would have to have to be 1... 11.... 111.... basically a bunch of digits in order with no letters in between.

OpenStudy (anonymous):

So one way is 1 digit and then 9 letters, with at least one capital and one lowercase

OpenStudy (anonymous):

So find how many ways we can have a password that is valid in (a) and not valid in (b) and subtract that from (a)

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!