Find the number of seven-letter words that use letters from the set $\{\alpha, \beta, \gamma\}$ and contain at least one $\alpha$ and at least two $\beta$'s.
I posted a similar problem before, in which one had to find the number of seven-letter words that use letters from the set $\{\alpha,\beta,\gamma,\delta, \epsilon\}$ and contain at least one each of $\alpha$, $\beta$ and $\gamma$. How can I modify that answer to the question above?
There are $\binom{7}{k}$ ways to fill exactly $k$ of the seven positions with a $\beta$ and $2^{7 - k}$ ways of filling the remaining positions with one of the other two letters. Of these $2^{7 - k}$ ways of filling the remaining positions with $\alpha$ or $\gamma$, only one way involves using only $\gamma$. Hence, there are $$\binom{7}{k}(2^{7 - k} - 1)$$ ways to fill exactly $k$ of the positions with $\beta$s if at least one $\alpha$ is used. Thus, the number of seven-letter words with at least two $\beta$s and at least one $\alpha$ is $$\sum_{k = 2}^{7} \binom{7}{k}(2^{7 - k} - 1) = \binom{7}{2}(2^5 - 1) + \binom{7}{3}(2^4 - 1) + \binom{7}{4}(2^3 - 1) + \binom{7}{5}(2^2 - 1) + \binom{7}{6}(2^6 - 1) + \binom{7}{7}(2^0 - 1) = 1491$$