# I don't want to be embarassed

**Computer Science**Level 3

Get a member of the audience to pick a card from the deck and with only the audience knowing the value of the card, place the card at the bottom of the pile.

Take the top half of the deck (26 cards) and place them at the bottom of the card.

Take the 26 cards in the middle and place them on top of the pile.

Remove the bottom 26 cards from the deck.

Once again, take 14 cards from the centre of the deck out and remove the other cards.

For the last time, we take 6 cards from the middle and remove everything else.

He then places all removed cards on top of the current deck in the order they were removed.

Pull out the \(n^{th}\) card from the top and show it to the audiences.

The question is, what is \(n\)?

**Definition of terms used**

\(n\) cards from the middle - We take the number of cards into the deck to be 5. if \(n=3\), if means the we take the 2nd, 3rd and 4th card.

The order they were removed - Assuming we have 7 cards and we remove the middle 3 cards(3rd, 4th, 5th) and then remove the middle 2 cards(2nd and 6th), we will then put the cards in order meaning that we first place the 3rd card, followed by the 4th, then the 5th, then the 2nd and lastly the 6th.