MathDB

There are seven cards in a hat, and on the card

k

there is a number

2^{k-1}

k=1,2,...,7

. Solarin picks the cards up at random from the hat, one card at a time, until the sum of the numbers on cards in his hand exceeds

124

. What is the most probable sum he can get?

Problem 5