--- title: "#forgotten-theories articles | Hashnode" description: "Explore 26 articles tagged #forgotten-theories on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/forgotten-theories" --- Tag # #forgotten-theories 26 posts · 0 followers [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/berkeleys-1973-admit-rates-flip-sign-when-you-stop-pooling-the-departments/6a025d302d1b69abf22b8207) ### [Berkeley's 1973 admit rates flip sign when you stop pooling the departments](https://forgottentheorieshashnodedev.hashnode.dev/berkeleys-1973-admit-rates-flip-sign-when-you-stop-pooling-the-departments?utm_source=hashnode&utm_medium=feed) In 1903 Udny Yule wrote a short paper on the association between two 7 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/berkeleys-1973-admit-rates-flip-sign-when-you-stop-pooling-the-departments?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/tsiolkovskys-1903-logarithm-still-draws-the-wall-for-chemical-rockets/6a025d5c2d1b69abf22b8217) ### [Tsiolkovsky's 1903 logarithm still draws the wall for chemical rockets](https://forgottentheorieshashnodedev.hashnode.dev/tsiolkovskys-1903-logarithm-still-draws-the-wall-for-chemical-rockets?utm_source=hashnode&utm_medium=feed) Konstantin Tsiolkovsky was a deaf schoolteacher in Kaluga who had 6 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/tsiolkovskys-1903-logarithm-still-draws-the-wall-for-chemical-rockets?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-rebuilt-the-1943-mcculloch-pitts-neuron-and-checked-all-256-three-input-boolean-functions-every-one-fit-in-a-two-layer-net-with-at-most-four-hidden-units/6a025d4e2d1b69abf22b8211) ### [I rebuilt the 1943 McCulloch-Pitts neuron and checked all 256 three-input Boolean functions. Every one fit in a two-layer net with at most four hidden units.](https://forgottentheorieshashnodedev.hashnode.dev/i-rebuilt-the-1943-mcculloch-pitts-neuron-and-checked-all-256-three-input-boolean-functions-every-one-fit-in-a-two-layer-net-with-at-most-four-hidden-units?utm_source=hashnode&utm_medium=feed) In 1943 Warren McCulloch, a neuropsychiatrist with a taste for logic, and Walter Pitts, a teenage runaway who had taught himself mathematics in the Chicago public library, published "A Logical Calculus of the Ideas Immanent in Nervous Activity". The 7 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-rebuilt-the-1943-mcculloch-pitts-neuron-and-checked-all-256-three-input-boolean-functions-every-one-fit-in-a-two-layer-net-with-at-most-four-hidden-units?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-tested-bertrands-1887-ballot-formula-on-648-vote-splits-and-the-answer-was-always-p-qpq/6a025d702d1b69abf22b821f) ### [I tested Bertrand's 1887 ballot formula on 648 vote splits and the answer was always (p-q)/(p+q).](https://forgottentheorieshashnodedev.hashnode.dev/i-tested-bertrands-1887-ballot-formula-on-648-vote-splits-and-the-answer-was-always-p-qpq?utm_source=hashnode&utm_medium=feed) In 1887 Joseph Bertrand sent a four-page note to the \*Comptes Rendus\* of the French Academy. The question he asked is one you can pose to a child. Two candidates run for office. A wins with p votes, B loses with q < p. The ballots are pulled from the 6 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-tested-bertrands-1887-ballot-formula-on-648-vote-splits-and-the-answer-was-always-p-qpq?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/fechners-1860-logarithm-loses-to-stevens-power-law-on-weight-brightness-and-loudness-by-35-53-aic-units/6a025d4b2d1b69abf22b820f) ### [Fechner's 1860 logarithm loses to Stevens' power law on weight, brightness, and loudness by 35-53 AIC units](https://forgottentheorieshashnodedev.hashnode.dev/fechners-1860-logarithm-loses-to-stevens-power-law-on-weight-brightness-and-loudness-by-35-53-aic-units?utm_source=hashnode&utm_medium=feed) Ernst Weber, working in Leipzig in the 1830s, ran a simple 7 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/fechners-1860-logarithm-loses-to-stevens-power-law-on-weight-brightness-and-loudness-by-35-53-aic-units?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-reran-axelrods-1981-prisoners-dilemma-tournament-tit-for-tat-still-earns-its-reputation/6a0251d675219ac8edfc2697) ### [I reran Axelrod's 1981 prisoner's dilemma tournament. Tit-for-tat still earns its reputation.](https://forgottentheorieshashnodedev.hashnode.dev/i-reran-axelrods-1981-prisoners-dilemma-tournament-tit-for-tat-still-earns-its-reputation?utm_source=hashnode&utm_medium=feed) In 1980, the political scientist Robert Axelrod sent letters to game 7 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-reran-axelrods-1981-prisoners-dilemma-tournament-tit-for-tat-still-earns-its-reputation?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-tested-von-misess-1939-birthday-claim-with-exact-arithmetic-and-105-monte-carlo-trials-per-group-size-23-people-really-is-enough/6a025d6e859efcceac079c31) ### [I tested von Mises's 1939 birthday claim with exact arithmetic and 10^5 Monte Carlo trials per group size. 23 people really is enough.](https://forgottentheorieshashnodedev.hashnode.dev/i-tested-von-misess-1939-birthday-claim-with-exact-arithmetic-and-105-monte-carlo-trials-per-group-size-23-people-really-is-enough?utm_source=hashnode&utm_medium=feed) In 1939 Richard von Mises published a short paper with the unwieldy title \*Über Aufteilungs- und Besetzungswahrscheinlichkeiten\*. Inside is the calculation that everyone now calls the birthday paradox. Pick 23 people at random. The probability that t 6 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-tested-von-misess-1939-birthday-claim-with-exact-arithmetic-and-105-monte-carlo-trials-per-group-size-23-people-really-is-enough?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/chebyshevs-1867-bound-holds-on-every-distribution-i-threw-at-it-and-a-two-point-mix-landed-within-02-of-saturating-it/6a025d6b2d1b69abf22b821d) ### [Chebyshev's 1867 bound holds on every distribution I threw at it, and a two-point mix landed within 0.2% of saturating it.](https://forgottentheorieshashnodedev.hashnode.dev/chebyshevs-1867-bound-holds-on-every-distribution-i-threw-at-it-and-a-two-point-mix-landed-within-02-of-saturating-it?utm_source=hashnode&utm_medium=feed) In 1867 Pafnuty Chebyshev published a short proof of an inequality that any student of probability eventually meets: 6 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/chebyshevs-1867-bound-holds-on-every-distribution-i-threw-at-it-and-a-two-point-mix-landed-within-02-of-saturating-it?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-located-the-first-30-zeros-of-riemanns-zeta-on-the-critical-line-they-all-sat-exactly-where-1859-said-they-would/6a025d642828387794138fa1) ### [I located the first 30 zeros of Riemann's zeta on the critical line. They all sat exactly where 1859 said they would.](https://forgottentheorieshashnodedev.hashnode.dev/i-located-the-first-30-zeros-of-riemanns-zeta-on-the-critical-line-they-all-sat-exactly-where-1859-said-they-would?utm_source=hashnode&utm_medium=feed) In November 1859, Bernhard Riemann submitted an eight-page memoir to the Berlin Academy. The paper was about prime numbers. Buried in the middle, almost as an aside, was a sentence that has shaped analytic number theory ever since: it is very likely 6 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-located-the-first-30-zeros-of-riemanns-zeta-on-the-critical-line-they-all-sat-exactly-where-1859-said-they-would?utm_source=hashnode&utm_medium=feed) [Macaulay001](https://hashnode.com/@oladimeji2025) · [May 11](https://hashnode.com/posts/i-counted-every-twin-prime-under-ten-million-hardy-and-littlewoods-1923-guess-landed-within-03/6a025d2e859efcceac079c29) ### [I counted every twin prime under ten million. Hardy and Littlewood's 1923 guess landed within 0.3%.](https://forgottentheorieshashnodedev.hashnode.dev/i-counted-every-twin-prime-under-ten-million-hardy-and-littlewoods-1923-guess-landed-within-03?utm_source=hashnode&utm_medium=feed) Twin primes are pairs of primes two apart: (3, 5), (5, 7), (11, 13), 6 min read · [forgottentheorieshashnodedev.hashnode.dev](https://forgottentheorieshashnodedev.hashnode.dev/i-counted-every-twin-prime-under-ten-million-hardy-and-littlewoods-1923-guess-landed-within-03?utm_source=hashnode&utm_medium=feed)