Suppose I keep drawing cards from a deck of cards(with replacement, meaning after I draw a card, I switch a new deck of cards but keep the card I draw) until I have drawn both a 1 and a 2. Then What is the expected number of times I would have to draw cards until I can stop?
I have no clue about how to compute such expectation numbers.
If you try something with probability $p>0$ of succeeding, you'll have to try on average $1/p$ times before succeeding (cf https://en.wikipedia.org/wiki/Geometric_distribution )
Thus, with $n\ge2$ cards in the deck, you'll draw the first 1 or 2 in $\frac{n}{2}$ tries and the second one in $n$ tries, so $\frac{3n}{2}$ is the answer