Requiring the fifty-fifty at every amount you could open forces the weights to satisfy f(x) = f(x/2)/2, whose only solutions are proportional to 1/x, and that integrates to infinity at both ends. Conditional on the pair, the swap gains the smaller amount or loses it with equal chance, which is zero and needs no assumption at all. The article carries a proper spread where the conditional answer is genuinely x/2, and the infinite-mean spread where swapping really is right at every observable amount.
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.
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 long hand turns 6 degrees a minute and the short one half a degree, so a 90 degree gap closes at 5.5 degrees a minute and the hands coincide 180/11 minutes past three, at 3:16:21.8181. At 3:15 the long hand has reached the 3 and the short hand is 7.5 degrees ahead of it, which is the whole content of the wrong answer. Consecutive coincidences are 720/11 minutes apart, so there are eleven per twelve hours and twenty-two per day, and the common phrasing "eleven times a day" is wrong by a factor of two.
Logarithmic differentiation turns the exponent into a factor and gives x^x times (1 + ln x), which is exactly the sum of the power-rule answer x^x and the exponential-rule answer x^x ln x. That is a theorem rather than a coincidence: the two rules are the partial derivatives of u^v, and walking the diagonal u = v = x adds both partial effects. The power rule accidentally returns the correct slope at x = 1, which is the one point nobody should use to test a rule.
Running straight out from the centre loses, because a radius costs you 1 while half the fence costs the dog pi over 4. Inside a quarter of the radius your angular speed beats his, so you can orbit until he is diametrically opposite and then sprint three quarters of a radius against his pi over 4, and the whole escape reduces to 3 being less than pi with a margin of 0.0354 R. That two-phase plan works only up to a speed ratio of pi + 1, while the best known strategy for the problem reaches 4.60334.
Servings follow area and area follows the square of the width, so feeding eight instead of six multiplies the diameter by the square root of four thirds: exactly 8 root 3, or 13.8564 inches, about 15.5 percent wider. Sixteen inches carries 16/9 of the area and would feed 10.67 people, so the reflex over-orders by nearly three servings. Allowing a one inch bare crust moves the answer down to 13.55, because a wider pizza spends proportionally less of itself on edge.
Differentiating y = L tan(wt) gives a spot speed of w R squared over L, so the footprint accelerates with the square of its distance from the lamp: a tenth of pi directly opposite, and exactly pi miles per second nine miles along. The 9 is the along-shore leg, which makes 90 the squared hypotenuse rather than the square of nine, and that misreading is the usual failure. Nothing physical moves at that speed, and a straight coast running 2310 miles would carry a nominally faster-than-light spot carrying no information at all.
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.
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.
Raise your right hand at a mirror and the reflected hand stays on the same side of the room, which means the usual question has a false premise. A plane mirror is the matrix diag(1, 1, -1): it fixes both axes lying in the glass and reverses only the direction you look along. Its determinant is -1, so no rotation reproduces it, and the sideways flip everyone reports belongs to the half turn you perform in your head.
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.
Multiplying by the conjugate turns the difference into x over the sum of the same two terms, exactly, with no series and no error term, and dividing through by x reads off the limit one half. Completing the square gives a constant excess of a quarter, so the gap climbs toward a half strictly from below and never reaches it.
The factor pi over four cancels off both sides, so the comparison is 324 against 244, about a third more pizza. Written that way it is the law of cosines: lay the three widths out as a triangle and the corner between the two smaller sides opens to 109.47 degrees, wider than square, which is the answer with no arithmetic at all.
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.
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.
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.
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.
The pour back really was diluted, and the conclusion still does not follow: both jars finish at six cups, so whatever left one jar was replaced cup for cup by what arrived. That argument needs no fractions and survives terrible stirring, while the number 1.5 cups does not.
Unfolding two faces into a 2 by 1 rectangle turns the walk into a straight segment of length root five, crossing the shared edge at half height. The reflex answer of one plus root two is the same one-parameter family evaluated at the end of that edge instead of its middle, so the trap and the answer are two points on one curve.
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.
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.
Halving the length and timing the flame is not a biased estimator of half the time, it is unrelated to it: across four thousand random cords the midpoint method scattered from under fifteen seconds to over forty-five. Lighting both ends gives exactly thirty on every cord, by an argument that never evaluates the burn rate.
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.
The North Pole really is a solution, so the trap is only the words "and nowhere else". A mile north of the parallel whose whole lap measures 1/n of a mile, the eastward mile is n exact revolutions, which puts a starting circle 1.159 miles from the South Pole for one lap, 1.080 for two, 1.053 for three. Every point of every circle works, so the honest count is uncountable rather than infinite.
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.
A boat carrying a dense rock floats in a pool; the rock goes over the side and sinks. The mass inside the pool is unchanged, so the reflex says the level cannot move, but it falls by exactly (d-1)V/A. The article carries the algebra the fifty-second version had no room for, plus the force balance on the sunk rock that shows the floor is where the argument closes.
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.
At 3:15 the minute hand is on the 3 and the angle between the hands looks like zero. It is 7.5 degrees, or pi/24 radians, because the hour hand crawls a quarter of the way from the 3 to the 4 while the minute hand travels a full lap. The zero answer is exact for a clock whose hour hand waits on each numeral and jumps, which is not a clock that exists.
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.
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.
Two riders twenty-five miles apart close at fifty miles an hour, so a forty mile an hour fly shuttling between them flies exactly twenty miles. The series of shuttle legs gives the same twenty, with a first leg of 100/7 and a round-trip ratio of 1/21, but no finite number of legs ever reaches it: after eighty legs the exact total is twenty minus about 2.6e-52. The general law is wD/(a+b), and it holds identically in the rider speeds rather than by luck at 20 and 30.
Independent guessing gives the prisoners 7.9 x 10^-31. Following the slip you just found gives them 0.311828, and the gap is thirty orders of magnitude from a rule you can state in one sentence. The strategy never raises anyone's individual chance above one half; it only makes the failures coincide, which is the whole lesson.
Two doors left is not two equal doors: your first pick was frozen at 1/3 and the other 2/3 piled onto the single door still closed. The number is not a fact about doors, it is a fact about the host. Let him open a door at random instead, show the same goat, and switching is worth exactly 1/2.
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.
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.
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.