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.
Cutting a hundred million of a thirty-year bond down to fifty takes five hundred futures, and the usual arithmetic of fifty million over a hundred thousand lands there only because the contract's duration per dollar of face happens to match the bond's. What a hedge matches is dollars per basis point: 56,288.92 against 112.5778. Hold a thirty-year zero instead and the same job needs 1,234 contracts, while five hundred three-month contracts would cover 22.2 per cent of it.
Fourteen billion fill-ups a year divided by what a pump could do at full tilt gives 25,000 stations; divided by what a pump actually does it gives 149,829, inside the published range. The gap is exactly six, and the article proves that six is the ratio of the two throughput guesses alone, because the fleet, the fill-up frequency, the opening hours and the pumps per station all cancel. The utilisation of one sixth is Little's law read as 2.67 busy hours in a sixteen-hour day.
Two outlets in a town of fifty thousand is one per twenty-five thousand people, which scaled to the United States gives 13,600 against a published count near 13,500. That 0.74 per cent is luck, and the article shows why: the answer is exactly inversely proportional to the one density guess, and sweeping it across every defensible value spans 8,500 to 22,667. A second chain built from revenue, sharing no input at all, lands at 13,615.
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.
A fair coin cuts probabilities into halves and quarters, and a short argument about the prime factorisation of two shows it can never reach one third in a bounded number of flips. Dropping the bound fixes it: flip twice, bin the tail-tail, and each child holds exactly a third for 8/3 flips on average. That naive scheme turns out to be the best any coin-flipping procedure can do for three outcomes, which stops being true at five.
One radius drawn to the rectangle's far corner turns the whole problem into a right triangle with legs R - 10 and R - 5, and the quadratic that follows has roots 5 and 25. Both satisfy the equation exactly, so rejecting 5 takes geometry rather than arithmetic: at that radius the corner really does touch the circle while the rectangle has already swallowed half the disk. The general a by b rectangle shows the discarded root is a permanent feature of squaring.
Three children's ages multiply to 36. Someone who knows the sum admits she cannot name them, and that admission is the only real clue in the problem. Eight triples, one repeated sum, and a second clue that eliminates nothing on its own yet decides everything once the first has run.
Factoring into p minus one times p plus one stops the question being about p: the two neighbours are consecutive even numbers so their product carries eight, and one of the three consecutive integers around p is a multiple of three which cannot be p itself. Since eight and three are coprime, 24 divides, and 24 is exactly maximal.
The midpoint of p and q sits strictly between them, and consecutive means precisely that no prime lives in that interval, so the answer is never and the proof is two lines with no arithmetic in it. The pair 2 and 3 survives for a different reason, since five halves is not an integer, and it is the only such pair.
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.
Every one of the nine conditions leaves a remainder one short of its divisor, so x plus one is divisible by all of 2 through 10 and the answer is 2519. Minimality comes free, and the whole solution set is 2520k minus 1. The article carries the coprimality caveat, the near miss 209 that satisfies six of the nine, and a variant where no shift exists.
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.
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.
Seven pieces cost six cuts and the schedule pays correctly, so the six-cut answer breaks one constraint and nothing else. Because the worker can hand pieces back, the contract is on his holding rather than on the transfer, and the ledger turns out to be a three-bit counter. Brute force finds 1-2-4 is the only three-piece solution.
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.
Adding fives and threes never reaches four, and that observation is correct. It is also about the wrong set, because a pour is a subtraction and the reachable amounts are the integer combinations rather than the natural ones. An exhaustive state-graph search proves six pours is minimal, and the four missing sums turn out to be the gaps of a numerical semigroup.
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.
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.
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.
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.
One condition, a two-line recurrence, and the fifth power falls out as a clean 123 with no radicals left. Climb the same ladder far enough and the golden ratio and the Lucas numbers are hiding underneath.
A line with rational coefficients maps ℚ onto ℚ. Nothing curved ever does. Three filters — interpolation, shape, denominators — leave the full classification.