|
|
|
|
|
|
|
least one fixed point. Mathematically literate hackers tend to associate the term 'hairy' with the informal version of this theorem; "You can't comb a hairy ball smooth." |
|
|
|
|
|
|
|
|
The adjective 'long-haired' is well-attested to have been in slang use among scientists and engineers during the early 1950s; it was equivalent to modern hairy senses 1 and 2, and was very likely ancestral to the hackish use. In fact the noun 'long-hair' was at the time used to describe a person satisfying sense 3. Both senses probably passed out of use when long hair was adopted as a signature trait by the 1960s counterculture, leaving hackish hairy as a sort of stunted mutant relic. |
|
|
|
|
|
|
|
|
HAKMEM /hak'mem/ n. MIT AI Memo 239 (February 1972). A legendary collection of neat mathematical and programming hacks contributed by many people at MIT and elsewhere. (The title of the memo really is "HAKMEM", which is a 6-letterism for 'hacks memo'.) Some of them are very useful techniques, powerful theorems, or interesting unsolved problems, but most fall into the category of mathematical and computer trivia. Here is a sampling of the entries (with authors), slightly paraphrased: |
|
|
|
|
|
|
|
|
Item 41 (Gene Salamin): There are exactly 23,000 prime numbers less than 218. |
|
|
|
|
|
|
|
|
Item 46 (Rich Schroeppel): The most probable suit distribution in bridge hands is 4432, as compared to 4333, which is the most evenly distributed. This is because the world likes to have unequal numbers: a thermodynamic effect saying things will not be in the state of lowest energy, but in the state of lowest disordered energy. |
|
|
|
|
|
|
|
|
Item 81 (Rich Schroeppel): Count the magic squares of order 5 (that is, all the 5-by-5 arrangements of the numbers from 1 to 25 such that all rows, columns, and diagonals add up to the same number). There are about 320 million, not counting those that differ only by rotation and reflection. |
|
|
|
|
|
|
|
|
Item 154 (Bill Gosper): The myth that any given programming language is machine independent is easily exploded by computing the sum of powers of 2. If the result loops with period = 1 with sign +, you are on a sign-magnitude machine. If the result loops with period = 1 at -1, you are on a twos-complement machine. If the result loops with period greater than 1, including the beginning, you are on a ones-complement machine. If the result loops with period greater than 1, not including the beginning, your machine isn't binary the pattern should tell you the base. If you run out of memory, you are on a string or bignum system. If arithmetic overflow is a fatal error, some fascist pig with a read-only mind is trying to enforce machine independence. But the very ability to trap over- |
|
|
|
|
|