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.
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.
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.
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.
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.
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.
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 respuesta refleja ronda las 180, la mitad del calendario. El umbral real es 23, porque una coincidencia necesita una pareja y 23 personas cargan con 253. El mismo razonamiento sitúa la pregunta « ¿alguien comparte MI cumpleaños? » en 253 personas, once veces más gente, y el umbral en raíz cuadrada que hay detrás de ambas explica que un identificador aleatorio de 64 bits se repita tras cinco mil millones de extracciones y no tras dieciocho trillones.
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.
Adivinando al azar, los presos valen 7,9 x 10^-31. Siguiendo el papel que acaban de encontrar, valen 0,311828, y las treinta órdenes de magnitud de diferencia caben en una regla de una frase. La estrategia no vuelve a nadie más afortunado: solo hace que los fracasos coincidan, y ahí está toda la lección.
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.
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.