This problem is based on the card game **Concentration**, otherwise known as the **Memory Game**.

**Rules:**
Concentration is played with a deck of \(2n\) cards. Any deck of cards composed of \(n\) pairs of identical cards can be used to play. The cards are shuffled around and put face down. The player can select two cards. If they match, both are removed from play. If not, they are flipped back into a face down position and the next move commences.The cards are removed from play if they match. The game ends when all pairs of cards have been correctly matched and removed from play.

If you want to have a go at playing it go ahead and try it here. In this problem, for simplicity, we shall **only have one player** (as in solitaire).

Let's demonstrate with an example. You pick \(2\) cards and turn the first over. It is a

Hopefully, the next card will be the same. If not, both will have to be turned back over. It is a

It's the same! Both cards are eliminated from play.

Let \(n=1729\)(the Hardy-Ramanujan number, in honour of the great mathematicians). Thus our deck is made up of \(1729\) pairs, or \(1729 \times 2=3458\) cards.

The expected number of moves needed to eliminate all of the cards is \(E\). Calculate \(E\), rounded to \(3\) decimal places.

**Extra Credit:**

Generalise this result for any \(n\).

**More Problems About Card Games:**

×

Problem Loading...

Note Loading...

Set Loading...