A ternary word is a word formed from the alphabet P = {0, 1, 2}. Considerthe set of all ternary words of length n. If such a word is chosen at random,determine an expression (in terms of n) for the probability that this worddoes not contain the bit pattern 00. Use your result to determine how largen must be for this probability to be less that 1/5.
so could you show me the exact calculation? i asked this question before and i am confused about where the (N-1) comes from. Could you explain?