A fair coin is tossed until heads ($H$) appears but is tossed only up to a maximum of $10^6$ times. If $H$ appears on the $n$-th toss, the player gets $2^{n-1}$ dollars. If all tosses are tails $(T)$ then you lose all of your money. The entrance fee for this game is $10^5$ dollars. Should you play this game?
I have tried to look at similar problems like this but I am not sure how to make the connection from: #of tosses until first heads to the chance that I will get at least one heads in the $10^6$ tosses and then subsequently turning that into an expected value. How can I solve this problem?