Whether an up move followed by a down move lands where a down move followed by an up move lands decides between a quadratic node count and an exponential one, and at twenty steps the gap is a factor of 9,078.6. Both sums carry N+1 terms rather than N, because a twenty-step tree has twenty-one dates on it, and the off-by-one costs the entire final row. The article also states the recombination hypothesis exactly, which is weaker than the usual ud = 1.
Sorting the list finds the gap and is merely wasteful, which is why the article says so rather than striking it out. The subtraction works because 5050 is a closed form available before the list is read, and the two conditions carrying it are distinctness and a known range. The article adds the duplicate-hunting mirror image, the sum-of-squares route when two values are absent, and the exclusive-or accumulator for when the total would overflow.
The dial totals 78, so each piece needs 26, and the pie instinct fails on all 220 possible cuts. The proof is three lines of triangular numbers: only one pair of running totals differs by 26, which forces the first two cracks and then demands a total of 62 that does not exist.
Four over fifty-two squared is exactly right for the question where the first card goes back, which is what makes it hard to catch. Removing a king shrinks the numerator proportionally more than the denominator, and the counting route through 1326 two-card hands confirms one in 221 without mentioning order at all.
Taking one coin from each bag reads 9.9 ounces whichever bag is light, and the failure is blindness rather than imprecision. Loading i coins from bag i makes the dial an injective function of the culprit, at a cost of the tenth triangular number. A 45-coin variant is cheaper, and powers of two identify any subset of light bags from one reading.
Person k flips every bulb that is a multiple of k, and after a hundred passes exactly the ten perfect squares are lit. Bulb n is flipped once per divisor, and the pairing d against n/d is fixed-point free unless n is a square, so the parity is decided by algebra rather than by accumulation. The lit fraction is one over the square root of the row, and stopping the process at person 50 inverts the answer to 54 bulbs.
You toss five fair coins, I toss four, and you win on strictly more heads: the answer is exactly 256 of the 512 outcomes. Because you hold one coin more, "not strictly more heads" and "strictly more tails" are the same event, and turning every coin over is a bijection between them. The fifth coin is worth nearly fourteen percentage points over the 93/256 you would have without it, and none of that is an edge.