Ethan Song and Bryan Guo are playing an unfair game of rock-paper-scissors. In any game, Ethan has a 2/5 chance to win, 2/5 chance to tie, and 1/5 chance to lose. How many games is Ethan expected to win before losing?

[i]2022 CCA Math Bonanza Lightning Round 4.3[/i]
1. **Adjusting Probabilities:**
   Since a tie does not affect the outcome, we can ignore ties and adjust the probabilities for wins and losses. The probability of winning becomes:
   \[
   P(\text{win}) = \frac{\frac{2}{5}}{\frac{2}{5} + \frac{1}{5}} = \frac{2/5}{3/5} = \frac{2}{3}
   \]
   Similarly, the probability of losing becomes:
   \[
   P(\text{loss}) = \frac{\frac{1}{5}}{\frac{2}{5} + \frac{1}{5}} = \frac{1/5}{3/5} = \frac{1}{3}
   \]

2. **Setting Up the Expectation Equation:**
   Let \( E \) be the expected number of games Ethan wins before losing. We can set up the following equation based on the states:
   \[
   E = \frac{2}{3}(E + 1) + \frac{1}{3}(0)
   \]
   Simplifying this, we get:
   \[
   E = \frac{2}{3}(E + 1)
   \]
   \[
   E = \frac{2}{3}E + \frac{2}{3}
   \]
   \[
   E - \frac{2}{3}E = \frac{2}{3}
   \]
   \[
   \frac{1}{3}E = \frac{2}{3}
   \]
   \[
   E = 2
   \]

3. **Verification Using Series:**
   We can also verify this by considering the series:
   \[
   E = \sum_{n=1}^{\infty} n \cdot \frac{1}{3} \cdot \left(\frac{2}{3}\right)^n
   \]
   This is an arithmetico-geometric series. To solve it, we use the known result for the sum of such series:
   \[
   \sum_{n=1}^{\infty} n x^n = \frac{x}{(1-x)^2}
   \]
   Substituting \( x = \frac{2}{3} \), we get:
   \[
   \sum_{n=1}^{\infty} n \left(\frac{2}{3}\right)^n = \frac{\frac{2}{3}}{\left(1 - \frac{2}{3}\right)^2} = \frac{\frac{2}{3}}{\left(\frac{1}{3}\right)^2} = \frac{\frac{2}{3}}{\frac{1}{9}} = 6
   \]
   Therefore:
   \[
   E = \frac{1}{3} \cdot 6 = 2
   \]

The final answer is \(\boxed{2}\).