1. The problem statement, all variables and given/known data A Dragon Imprisoned a knight and gave him 100 distinct coins, half of which were magic (only the dragon knew which coins were magic). Every day the knight splits all coins into two piles (not necessarily equal). If two piles include either an equal number of magic coins or an equal number of ordinary coins, then the dragon will release the knight. Can the knight guarantee himself freedom in at most 2. Relevant equations N/A 3. The attempt at a solution Tried doing dome hyper geometric distribution, but was useless.