How many 4-letter words can I make with the letters $\{W, X, Y, Z\}$ if the letter $W$ must be used an odd number of times? Assume I can repeat letters.
How do I create cases to count W for odd number of times it is used? Is there another way to solve this without using casework?
Let's solve this problem for the $n$-letters words.
Let's call $A_n$ the $n$-letter words with an odd number of $W$ and let's call $B_n$ the $n$-letter words with an even number of $W$. We know that $$ A_n = 3A_{n-1}+B_{n-1}$$ and that $$B_n=3B_{n-1}+A_{n-1}$$ (think to the last letter you add).
Moreover, you know that $A_1=1$, $A_2=6$, $B_1=3$, $B_2=10$.
Knowing this you can create a table and fill it using this rules.
(EDIT: I think that working on these two equation MAYBE you can create a closed formula but idk)