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

Passwords for a certain computer system are strings of uppercase letters. A valid password must contain an even number of X's. Determine a recurrence relation for the number of valid passwords of length n.

OpenStudy (anonymous):

n0=1,n1=1,n2=2,n3=4,n4=7, do those base cases look correct?

OpenStudy (anonymous):

actually, n4=8, does the recurrence relation have anything to do with it being powers of 2?

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!