An American call that only wakes up at 80 and dies for good at 125 has no closed form, and it cannot be simulated either, because a path runs forward while the exercise decision looks back. Every path that avoids the ceiling either visited the floor or never did, so the contract is one knock-out minus another and both come off a standard tree. The identity is exact to machine precision for European exercise at all seven grids tested, and for American exercise only in the continuous limit: the finite-tree residual falls from 0.532 percent at 45 steps to 0.043 percent at 3,394.
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.
Both seats in the marble game average a dollar a play, and that arithmetic stays true to the last line. Seat A carries variance 3/2 against seat B's 1, and seat A's law turns out to be seat B's law with one prize smeared outward, so every concave utility prefers B without variance ever being mentioned. Once both players stop flipping coins, seat B is ahead on the average too, at 1 against 3/4.
A holding pays $200 if a team wins four games first, you must take a symmetric position on every game, and committing the whole hundred to game one produces the right payoffs a week too early. Backward induction on the lattice fixes the amount at half the gap between the two successor values, $31.25. The same number is 5/16 of the holding, which is the chance the other six games split three each, and no win probability appears anywhere in the derivation.
Dividing the cabin by the ball gives 29.8 million, which is exact arithmetic on the assumption that spheres tile space. They do not, and the correction is pinned on both sides by constants: a plain cubic grid anyone can build holds exactly 15,625,000 balls, and no arrangement whatever beats pi over root eighteen, which caps the count at 22.1 million. The answer is that interval, with a settled pour at 19.1 million sitting inside it.
Acceptance restricts the value to below your bid, where a uniform variable averages half of it, and doubling half your bid returns exactly your bid. The expected profit is therefore identically zero at every bid up to 100 and 100 minus b above it, so there is no optimal bid to find. With a general multiplier the profit is b squared times k minus 2, over 200, making doubling the exact break-even multiple, and the article shows a value distribution starting at 50 where the same bidder profits.
Going in and winning are different events: the short shot clears two hurdles and wins 0.35 of the time against the long shot's 0.40. The article prices how wrong the reflex is in two currencies, a break-even overtime rate of 4/7 and a break-even make rate of 80 percent at a coin-flip overtime. It also names the objective under which the reflex is right, since the short shot scores 1.40 expected points against 1.20 and still wins fewer games.
Four settlements in five come back below the 1.50 outlay, and the average payoff is still 1.80, an edge of 0.30 a contract or twenty percent of the money at risk. The reflex is not bad arithmetic, it is the mode standing in for the mean. The article carries the tally over one full cycle, the threshold saying you need the large outcome more often than one time in eight, and the reason waiting longer can leave you less likely to be ahead.
One chance in sixteen needs fifteen to one to break even, so a ten-to-one ticket is priced as though the calls came right nine times in a hundred rather than six and a quarter. The fair payout doubles and adds one with every leg, which is why multi-leg tickets run away from any quote a seller offers. The article carries the noise that hides the loss, 2.663 of spread against 0.3125 of edge, and the five-point edge per leg that would flip the verdict.
Turning all fifty-two cards lands on exactly zero, which makes zero the floor rather than the value. Backward induction over the grid of remaining cards gives the exact rational 41984711742427/15997372030584, and a two-line argument shows the optimal policy can never finish below zero in any deal. The article carries the small-deck ladder, the stopping boundary the table actually produces, and two plausible rules that lose money against it.
Twenty-four possible answers against 3^3 = 27 outcome sequences leaves just enough room, and four against four splits those answers into exactly 8, 8 and 8. Six against six always tips, so it wastes the level outcome and leaves twelve answers for nine remaining sequences, which makes halving impossible rather than merely slow. The counting argument bounds outcome sequences rather than strategies, so it rules out every adaptive continuation at once, and the explicit schedule closes the positive half.
The fraction that maximises long-run growth is exactly the edge, 2p-1, which is 0.2 on this coin, and one derivative gets you there. Double it and the growth rate is -0.0024469 a flip, negative on a game that leans your way three hundred times in a row, and the crossing happens at 0.3894 rather than at 0.4. The article carries the exact median over 300 flips, 25 dollars to 10504.19 at the optimum and to 12.00 at double, the reason about 48 percent of overbettors still finish ahead anyway, and the place where the textbook approximation mean minus half the variance returns the opposite sign.
Take the centre, then mirror every move through it, and you place the last coin. The proof has three requirements and only one of them needs that opening move, which is the step a one-line answer skips. Central symmetry alone is not the condition: an annulus is centrally symmetric and the first player loses on it.
A stranger says out loud what every islander can already see, and ten days later ten people leave. The fact was mutual knowledge all along; what the announcement supplied was the nine levels of nested knowledge above it. An explicit count over 4096 possible worlds settles the induction without trusting it.
Nine slots hold the digits 1 to 9 and four overlapping windows each add to 20. One subtraction pins the centre digit to 5 with no search at all, and the same structure classifies every arrangement: there are 96 of them, falling into 48 mirror pairs. Change the target and the centre is forced to an odd digit that sometimes admits nothing.
A safe takes three numbers from a dial marked 1 to 40, so there are 64,000 combinations, and the worst case is 1600 attempts rather than 64,000. The third number is supplied by the mechanism instead of guessed, which collapses the search from three dimensions to two, and 1600 is proved both achievable and unavoidable. A dial with a mark of mechanical slack drops the count to 196, which is a covering problem on a cycle of forty.
A die is rolled up to three times and you are paid the face you stop on. The reflex answer of 3.5 is the value of the same game with the right to stop deleted, and the real value is 14/3, reached by computing the game from its last roll backwards. The thresholds move as rolls run out, which is why a four is worth keeping late and worth rejecting early.
Wind appears nowhere in the winning condition, so delete it: three cards in six equally likely orders, and you win in the two where fire comes last. One in four is the correct probability that fire is last of all four cards, a strictly smaller event, and the gap is exactly one twelfth.
Every family averages exactly one girl and contains exactly one boy, so the ratio of expected counts is exactly one half and a large town splits evenly. The expected share inside a single family is not one half but ln 2, and it is still 0.5249 across ten families, with the excess falling off like one over four m.
Of the eight colour triples, seven are feasible from a pool of three blue hats and two red. The first silence removes one, the second removes two more, and all four survivors put a blue hat on the third man, which is what makes his answer a deduction rather than a lucky call. A pool sweep shows three blue and two red is the only small pool where the story can happen.
Six pairings have to be separated by a single observation, and a light-only strategy always leaves at least two candidates standing. Warmth is a genuine third readable state, and three states handed to three bulbs give exactly six readings, one per pairing. The article carries the impossibility count and the four-switch case where the trick fails.
Counting to fifty in steps of one to ten, the first player wins, and exactly one of the ten legal openings does it. The stations are 6, 17, 28, 39 and 50, spaced eleven apart because eleven is one more than the largest legal step. The article carries the residue argument that proves the opening is unique, and the target 55 where the advantage flips.
The pile really does average exactly one dollar, which is why almost everyone answers one dollar and why the trap is a correct calculation of the wrong quantity. The play is worth two thirds, because the roll that ends the game pays on two of its three faces and that roll is independent of how big the pile grew.
A pebble climbing four boxes on coin flips needs 18/5 flips on average, and the two-line renewal argument that gives 4 is wrong. Its premise is true, since half of all games really do end on flip two, but the non-finishing half is two different states: tails-tails sends the pebble home while heads-heads leaves it on box 3, one flip from the exit and worth only 14/5.
Every route across a five by five grid is ten steps long with exactly five going east, so counting routes is choosing which five of the ten slots are east. The reflex 1024 is the exact number of free ten-step walks, and only 252 of them arrive. Forbid the route to rise above the diagonal and the count collapses to the Catalan number 42.
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.
Three and a half is the exact average of a plain die, which is why it survives being double-checked. The rule does not reweight six outcomes, it deletes one, leaving a uniform payoff on five faces and an answer of four. The procedure costs 1.2 rolls on average, and the version where the reroll is your choice is a different game worth 4.25.
Multiplying four rings a minute by five gives a quantity in inverse minutes squared, so a dimension check kills the twenty-second answer before any number theory. Converting to gaps makes the ring times two arithmetic progressions whose intersection is the least common multiple. Shift one bell by a second and the two never coincide at all.
Thirty-two rings really do take 136 years at a move a second, which is what makes doubling it to 272 so tempting. The exact ratio between the two cases factors as two to the thirty-two plus one, so the guess is short by more than four billion times. The article carries the lower bound the recursion alone does not give, and the 2-adic rule for which ring moves when.
Cut two diagonally opposite corners off a chessboard and 62 = 2 x 31 stays true, yet nothing fits. Writing the colour of a square as the sign (-1)^(i+j) turns the argument into arithmetic: every domino sums to zero, the two lost corners both carried +1, and the board left over is 30 against 32. The converse, Gomory's theorem, is the harder half and it goes the other way.
You hit one time in ten, your two opponents three and six, and you shoot first. Firing into the air is worth 965/4736 = 20.376%, which beats removing the strongest player by 0.195 percentage points, because a landed hit drops you into the duel you must enter second at 7/37 rather than first at 10/37. The article carries all three option values, the fixed points they solve, and the single Nash equilibrium that turns the usual assumption into a conclusion.
Stack i + j - 1 cubes on every square of a 20 by 20 board and the total is 8000, which is 20 cubed. Folding the board across the squares that are exactly 20 deep pairs every stack with a mirror stack, and each pair adds to 40, so the average depth is 20. The double sum gets the same answer and is merely slow, and the main diagonal is the fold that proves nothing.
La réponse réflexe tourne autour de 180, la moitié du calendrier. Le vrai seuil est 23, parce qu'une coïncidence demande une paire et que 23 personnes en portent 253. Le même raisonnement met la question « quelqu'un partage-t-il MON anniversaire » à 253 personnes, onze fois plus de monde, et le seuil en racine carrée derrière les deux explique qu'un identifiant aléatoire de 64 bits se répète après cinq milliards de tirages et non dix-huit trillions.
A driver who eats one apple per loaded mile delivers 833 of 3000 across a thousand miles, because the price of a mile is the ceiling of the stock over the truck's capacity: three apples, then two, then one. The continuous optimum is 2500/3, but rounding the switch point down to mile 333 leaves 2001 apples needing three passes and produces a fake 834. A lower bound on loaded traversals proves 833 optimal without a dynamic programme, and the free return legs are the clause that separates 833 from 533.
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.
En devinant au hasard, les prisonniers valent 7,9 x 10^-31. En suivant le papier qu'ils viennent de trouver, ils valent 0,311828, et l'écart de trente ordres de grandeur tient dans une règle d'une phrase. La stratégie ne rend personne plus chanceux : elle ne fait que rendre les échecs simultanés, et c'est là toute la leçon.
One lily doubling daily covers the pond on day thirty, so eight lilies must finish in 30/8 = 3.75 days. They finish on day twenty-seven, because eight is two cubed and that slides the whole schedule exactly three days earlier. The article carries the general rule that k lilies save the floor of log base two of k, the case where five lilies save only two, and the non-overlap assumption the answer quietly rests on.
Three feet up each day, one foot back each night, ten feet to climb. Dividing ten by the net two feet a day gives five days, and it charges the snail for a night it never spends. The dawn heights settle the day, the last climb settles the moment, and the closed form the video had no room to voice is a single ceiling function.
Fifty white marbles, fifty black, two jars, and a fair coin choosing which jar gets drawn from. The even split gives exactly one half, and so does every other split where the jars are the same size. Isolating a single white marble reaches 74/99, an exchange argument proves nothing beats it, and three quarters turns out to be a ceiling no arrangement ever touches.
Drop chips at random into dough, cut it into a hundred cookies, and ask how many chips guarantee no bare cookie nine times out of ten. Five hundred chips, five per cookie on average, works about half the time. Inclusion-exclusion pins the answer at 683, a closed form you can solve on a whiteboard agrees, and the coupon collector's mean of 518.7 is the sophisticated wrong answer.
Strip the outer shell off a ten-by-ten-by-ten block of unit cubes and count what falls. The reflex answer, 271, is arithmetic done correctly on the wrong picture: a shell leaves from both opposing faces, so every axis loses two units and not one. Two independent counts land on 488, and the general shell turns out to grow like a surface rather than a volume.
A counterfeit coin that might be heavy or light, a balance that only reports which side falls, and a hundred dollars a weighing. Counting rules out four; only a construction gets you five.
Les résultats d'un toutes-rondes peuvent être un chaos total : des cycles partout, aucun champion. Une récurrence en un seul coup aligne pourtant tout le monde, chacun ayant battu le suivant.