Pike Pond Problem: What Is the Maximum Number of Pike That Can Be Satisfied?

A classic weekend puzzle — the kind that rewards a few minutes of careful thought.

The Pike Pond Math Puzzle

Here is the problem:

30 pike are released into a pond and gradually begin eating one another. A pike is considered satisfied if it eats exactly three pike — whether those pike were satisfied or hungry. What is the maximum number of pike that can be satisfied?

At first glance it might seem like a straightforward counting exercise. In practice, it is a beautiful example of the extremal principle at work in olympiad mathematics.

Why This Is an Extremal Principle Problem

The extremal principle in olympiad math is a strategy for finding the maximum (or minimum) of a quantity by identifying a constraint that limits how large (or small) it can get. Rather than trying to construct every possible scenario, you establish a bound from above — and then show the bound is tight by building one valid example that achieves it.

In the pike pond problem, the question “what is the maximum number of satisfied pike?” is a direct invitation to apply this technique. The key is finding the right invariant.

Setting Up the Bound

Let S be the number of satisfied pike. Each satisfied pike ate exactly 3 others, so the total number of pike eaten across all events is 3S.

Since the pond starts with 30 pike and each eating event removes exactly one pike, the number of pike remaining at the end is:

Remaining = 30 − 3S

Now here is the critical observation: the S satisfied pike must themselves be among the survivors — they ate, but were not eaten. This gives us the inequality:

30 − 3S ≥ S

Solving:

30 ≥ 4S → S ≤ 7.5

Since S must be a whole number, we get S ≤ 7. No matter how the eating unfolds, at most 7 pike can be satisfied.

Achieving the Maximum in the Pike Pond Math Puzzle

An upper bound only becomes an answer once we confirm it is reachable. Here is one explicit construction that achieves exactly 7 satisfied pike.

Divide the 30 pike into 7 groups of 4, plus 2 individual pike left over. In each group of 4, one “dominant” pike eats the other three and becomes satisfied. This produces:

• 7 satisfied pike (one from each group)
• 2 hungry pike (the leftover individuals)
• Total survivors: 9 pike

No further eating is necessary. The construction is valid, achievable, and uses no pike more than once.

The Answer

The maximum number of pike that can be satisfied is 9.

Wait — let us be precise. The maximum number of satisfied pike is 7. The total number of survivors is 9 (7 satisfied and 2 hungry), but the question asks specifically about satisfied pike.

The bound S ≤ 7 is tight: we can construct a valid scenario reaching it, and no scenario can exceed it. That combination — a proven upper bound plus a matching construction — is the hallmark of a clean extremal principle argument.

Why This Puzzle Matters in Olympiad Math

The pike pond math puzzle is memorable because the bound emerges from a simple resource-counting argument. You do not need to simulate every possible sequence of events. You just ask: what does each satisfied pike cost, and how many can the starting pool afford?

This style of reasoning — find what is conserved or constrained, derive the bound, then construct an example — appears throughout combinatorics and number theory olympiad problems. Mastering it on small, concrete puzzles like this one is the best preparation for the harder cases where the invariant is less obvious.