One point away — page 3
A market too large to bargain in
Two traders swapping goods can settle anywhere along a stretch of possible deals; nothing forces a price. Bring in a second pair of the same traders and some of those deals can be refused by a group of three. With thirty of each, the only deals no group can refuse lie within a few thousandths of the one a price would produce. Edgeworth guessed in 1881 that competition shrinks bargaining to prices; Debreu and Scarf proved it, and the shrinking can be computed.
The slope a Gauss sum leaves behind
Riemann is said to have offered sin x + sin(4x)/4 + sin(9x)/9 + … as a continuous function with no derivative anywhere. It has one after all, at π and at every π times an odd number over an odd number, and the slope there is always exactly −1/2. Computed with a million terms, the function's behaviour at every fraction is read off a single number — a quadratic Gauss sum — and the slope appears exactly where that number is zero.
A cut that gets sharper as the map gets lazier
Iterating a map that shrinks distances by 0.9999 takes 141,254 steps to reach its fixed point to a millionth. Cutting takes six: read the map at one point, and the fixed point must lie on the far side of the line halfway between the point and its image. The cut gets better exactly where iteration gets worse, because a map that barely shrinks puts its fixed point almost on every such line.
One number for each arm
Several slot machines pay at unknown rates, and each pull both earns and teaches. The problem seems to tangle every machine with every other, and in the 1940s it was thought hopeless. Then John Gittins found that each machine alone has one number, and the rule is to play the highest. An exact search over 1,187,671 states of two arms gets the same value to six places.