Set combinations

35 Views Asked by At

Assume all strings of length 3 from the set S = {A,C,G,T}, (allowing repetition) are equally likely. What is the probability that such a string has no C given that it has no A?

Totally lost with this question.

1

There are 1 best solutions below

0
On

The reduced sample space after '$A$' has been removed has $3^3$ unique strings. How many of them have no '$C$'? Then form the correct quotient.