Blind Coin Flip Strategy
You are blindfolded and sitting in front of a table with $N$ coins. Exactly $k$ of them are heads up -- you are told $k$, but you cannot see or feel which specific coins are heads. You are allowed to flip any coins you like (you can pick them up and flip them, but you still cannot determine their current state).
Your goal: design a strategy that guarantees, after your move, both groups of coins (that you define) end up with the same number of heads -- no matter how the original $k$ heads are arranged. You know $N$ and $k$ in advance. Find such a strategy.
Hints
- You know $k$ exactly -- think about how to use that number to define your move, even without seeing any individual coin.
- Try splitting the coins into two groups: one of size $k$ and one of size $N - k$. What happens if you flip every coin in the smaller group?
- Let $h$ be the (unknown) number of heads among your chosen $k$ coins. Track heads in each group before and after flipping, and watch what happens to $h$ in the final expression.
Worked Solution
How to Think About It: The frustrating thing about this problem is that you seem to have no information -- you are blindfolded and cannot see any coin. But you know $k$, the total number of heads. The key insight is that you can use this number to engineer a clever partition. The idea is: pick exactly $k$ coins at random and flip all of them. You have no idea what state those $k$ coins are in -- but you do not need to. The algebra works out regardless.
This is a proof problem, so after the insight the job is to verify the claim algebraically for an arbitrary starting arrangement.
Key Insight: Splitting out exactly $k$ coins and flipping them all makes the two groups have equal head counts -- and this holds for every possible initial arrangement of the $k$ heads.
The Strategy:
- Pick any $k$ coins from the $N$ on the table (blind -- you have no idea which are heads).
- Flip all $k$ of them.
- Claim: after this, the $k$-coin group (Group A) and the $(N-k)$-coin group (Group B) each have the same number of heads.
Verification:
Let $h$ be the number of heads that happened to land in Group A before any flipping. Since there are $k$ heads total and Group A has $k$ coins:
- Group A before flip: $h$ heads, $k - h$ tails
- Group B (untouched): $k - h$ heads
After flipping all $k$ coins in Group A:
- Group A after flip: the $h$ heads become tails, the $k - h$ tails become heads, so Group A now has $k - h$ heads
- Group B is unchanged: still $k - h$ heads
$$\text{Group A heads} = k - h \qquad \text{Group B heads} = k - h$$
Both groups have exactly $k - h$ heads. The unknown $h$ drops out -- the result holds for any value of $h$ from $0$ to $k$.
Special cases to sanity-check: - $h = 0$: all $k$ heads are in Group B. After flipping Group A (all tails), Group A gains $k$ heads. Group B has $k$ heads. Both have $k$. Check. - $h = k$: all $k$ heads are in Group A. After flipping Group A (all heads become tails), Group A has $0$ heads. Group B has $0$ heads. Both have $0$. Check.
Answer: Separate any $k$ coins into a group and flip all of them. Regardless of the initial arrangement, both groups will have exactly $k - h$ heads, where $h$ is whatever happened to be in your chosen group. Since $h$ cancels, the strategy is guaranteed to work.
Intuition
The trick here is that knowing the total count $k$ is enough to engineer certainty, even when you have zero information about individual coins. By choosing a group of exactly $k$ coins and flipping them all, you are essentially creating a complementary transformation: whatever heads were NOT in your group (there are $k - h$ of them) is exactly matched by the flipped tails in your group (also $k - h$). The unknown $h$ appears symmetrically on both sides and cancels -- the two groups always equalize.
This kind of argument shows up broadly in combinatorics and information theory: you can sometimes guarantee a global property (balance between two groups) without any local information (which specific coins are heads). In trading and risk, a similar flavor appears in hedging arguments -- you can neutralize a risk you cannot directly observe by taking a position sized to match the aggregate exposure, even when you do not know the breakdown. The lesson is that aggregate constraints, combined with the right structural move, can pin down outcomes that seem to require information you do not have.