Skip to content
Get started

The five-card trick on a bigger deck

A spectator draws 5 cards from a deck of nn distinct cards (numbered 1..n1..n) and hands them to the assistant. The assistant hides one of the five and shows the other four to the magician in a chosen order, face up, one after another. The magician must then name the hidden card. Nothing else may be communicated. What is the largest nn for which the assistant and magician can agree on a method that always works?

Show hints (3)+
  1. Two different hands can never produce the same ordered 4-tuple. Count both sides.
  2. Compare (n5)\binom n5 with n(n−1)(n−2)(n−3)n(n-1)(n-2)(n-3).
  3. For achievability, think of a bipartite matching between hands and messages.

Answer

Reveal answer →

124

Create a free account to see the full worked solution and track your progress.

Interview format: Hedge Fund Quant, Prop Trading

Related questions