<![CDATA[MKLab - PROBABILITY AND STATISTICS]]>

<![CDATA[MKLab - PROBABILITY AND STATISTICS]]> https://mklab.gr/ Sun, 13 Sep 2026 11:16:21 +0000 MyBB <![CDATA[Where Did Combinators Come From ?]]> https://mklab.gr/showthread.php?tid=1865 Sun, 06 Sep 2026 00:28:45 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1865 Author: Stephen Wolfram
Submitted: 18 August 2021
Field: History of Mathematics / Mathematical Logic / Foundations of Computation
arXiv: 2108.08707 (arXiv)

Stephen Wolfram’s article is a historical investigation of Moses Schönfinkel (1888–?), the mathematician who introduced combinators in a lecture to the Göttingen Mathematical Society on 7 December 1920. Wolfram argues that Schönfinkel’s work deserves a much more prominent place in the history of computation: sixteen years before Turing machines, Schönfinkel developed a formal system in which arbitrary functions could, in principle, be represented by combinations of a tiny number of primitive operations. His ideas appeared in the 1924 paper Über die Bausteine der mathematischen Logik (“On the Building Blocks of Mathematical Logic”). The essential primitives are what are now called the $S$ and $K$ combinators, which may be written as
$Kxy=x$
and
$Sxyz=xz(yz)$.

From combinations of these extraordinarily simple rules one can construct general computations without introducing explicitly named variables. Wolfram therefore characterizes Schönfinkel’s system as an exceptionally early—and strikingly minimal—formalism for what we now understand as universal computation.

Much of the paper reconstructs Schönfinkel’s almost-lost biography from archival material. Born in Ekaterinoslav, now Dnipro, in 1888, Schönfinkel studied mathematics at Odessa and later went to Göttingen, where he was connected with the intellectual circle surrounding David Hilbert and Paul Bernays. He helped prepare notes for Hilbert’s 1920 lectures on mathematical logic and presented his revolutionary combinator ideas later that year. Yet his academic career never developed conventionally. In 1924 he left Göttingen for Moscow; after that, reliable information becomes scarce. Contemporary reports claimed that he became mentally ill and entered a sanatorium, while later stories said that he died impoverished around 1940–42, but Wolfram emphasizes that much of this remains uncertain and is supported largely by indirect testimony rather than definitive records.

The larger theme is how an extraordinarily important idea can almost disappear from intellectual history. Haskell Curry encountered Schönfinkel’s work in 1927 and subsequently developed combinatory logic much further, while lambda calculus and Turing machines eventually became much better-known foundations for computation. Schönfinkel’s original paper largely vanished from attention until it was republished in English in Jean van Heijenoort’s influential 1967 collection From Frege to Gödel. Wolfram argues that Schönfinkel’s achievement was especially remarkable because he identified the essential structure of computation before computers existed and before “computation” itself had become a clearly articulated mathematical concept. In this sense, the whole intellectual legacy of an almost forgotten mathematician became compressed into two tiny symbols: $S$ and $K$.

Key takeaways

Schönfinkel anticipated fundamental ideas of theoretical computer science in 1920, long before Turing machines and modern programming languages.
The combinators $S$ and $K$ show that extremely simple symbolic transformation rules can generate arbitrarily complex computations.
His work became the foundation of combinatory logic and is closely related to lambda calculus, functional programming, and ideas such as currying.
Wolfram’s paper is as much a piece of mathematical detective work as mathematics: it reconstructs the life of a nearly forgotten figure whose ideas became fundamental to our modern conception of computation.

ARTICLE [PDF]]]> Author: Stephen Wolfram
Submitted: 18 August 2021
Field: History of Mathematics / Mathematical Logic / Foundations of Computation
arXiv: 2108.08707 (arXiv)

Stephen Wolfram’s article is a historical investigation of Moses Schönfinkel (1888–?), the mathematician who introduced combinators in a lecture to the Göttingen Mathematical Society on 7 December 1920. Wolfram argues that Schönfinkel’s work deserves a much more prominent place in the history of computation: sixteen years before Turing machines, Schönfinkel developed a formal system in which arbitrary functions could, in principle, be represented by combinations of a tiny number of primitive operations. His ideas appeared in the 1924 paper Über die Bausteine der mathematischen Logik (“On the Building Blocks of Mathematical Logic”). The essential primitives are what are now called the $S$ and $K$ combinators, which may be written as
$Kxy=x$
and
$Sxyz=xz(yz)$.

From combinations of these extraordinarily simple rules one can construct general computations without introducing explicitly named variables. Wolfram therefore characterizes Schönfinkel’s system as an exceptionally early—and strikingly minimal—formalism for what we now understand as universal computation.

Much of the paper reconstructs Schönfinkel’s almost-lost biography from archival material. Born in Ekaterinoslav, now Dnipro, in 1888, Schönfinkel studied mathematics at Odessa and later went to Göttingen, where he was connected with the intellectual circle surrounding David Hilbert and Paul Bernays. He helped prepare notes for Hilbert’s 1920 lectures on mathematical logic and presented his revolutionary combinator ideas later that year. Yet his academic career never developed conventionally. In 1924 he left Göttingen for Moscow; after that, reliable information becomes scarce. Contemporary reports claimed that he became mentally ill and entered a sanatorium, while later stories said that he died impoverished around 1940–42, but Wolfram emphasizes that much of this remains uncertain and is supported largely by indirect testimony rather than definitive records.

The larger theme is how an extraordinarily important idea can almost disappear from intellectual history. Haskell Curry encountered Schönfinkel’s work in 1927 and subsequently developed combinatory logic much further, while lambda calculus and Turing machines eventually became much better-known foundations for computation. Schönfinkel’s original paper largely vanished from attention until it was republished in English in Jean van Heijenoort’s influential 1967 collection From Frege to Gödel. Wolfram argues that Schönfinkel’s achievement was especially remarkable because he identified the essential structure of computation before computers existed and before “computation” itself had become a clearly articulated mathematical concept. In this sense, the whole intellectual legacy of an almost forgotten mathematician became compressed into two tiny symbols: $S$ and $K$.

Key takeaways

Schönfinkel anticipated fundamental ideas of theoretical computer science in 1920, long before Turing machines and modern programming languages.
The combinators $S$ and $K$ show that extremely simple symbolic transformation rules can generate arbitrarily complex computations.
His work became the foundation of combinatory logic and is closely related to lambda calculus, functional programming, and ideas such as currying.
Wolfram’s paper is as much a piece of mathematical detective work as mathematics: it reconstructs the life of a nearly forgotten figure whose ideas became fundamental to our modern conception of computation.

ARTICLE [PDF]]]> <![CDATA[History as a giant data set]]> https://mklab.gr/showthread.php?tid=1860 Sat, 05 Sep 2026 23:47:08 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1860 Author: Laura Spinney
Publication:The Guardian
Publication date: 12 November 2019

The article explores cliodynamics, an emerging discipline that treats history as a vast data set and uses mathematics, statistics and computer modelling to search for recurring patterns in the rise and decline of societies. Its central figure is Peter Turchin, originally a mathematical biologist, who argues that social systems can be studied much like ecological systems. His models suggest that societies often experience long “secular cycles” of prosperity and instability, driven by interacting factors such as population pressure, declining living standards, competition among elites, inequality and weakening state finances. These ideas build substantially on the earlier work of Jack Goldstone, who developed a political stress indicator, usually denoted $\Psi$, to represent the combined pressures generated by mass mobilisation, elite competition and fiscal weakness.

A major development behind this approach is the availability of enormous historical databases such as Seshat, which collects quantitative information about hundreds of societies across thousands of years. Researchers can use indirect evidence—coin hoards, skeletal remains, building sizes, wages, demographic records and even environmental proxies—to reconstruct variables that cannot be measured directly. Turchin argues that such data reveal recurring long-term cycles as well as shorter roughly 50-year “fathers-and-sons” oscillations in political violence. Applied to the United States, his models showed rising structural political stress from around the 1970s onward, which led him years in advance to identify the period around 2020 as one of elevated instability.

The article nevertheless emphasizes that cliodynamics is probabilistic rather than deterministic. It cannot predict the exact event that triggers a revolution or crisis; instead, it attempts to measure whether a society has become structurally vulnerable, in much the same way that meteorology estimates the probability of severe weather. Critics—particularly many traditional historians—argue that human behaviour is too contingent and culturally specific to be captured reliably by equations, and that large historical databases may reproduce biases or strip evidence of its context. Turchin's more ambitious claim is therefore not that mathematics can foretell history, but that quantitative models might eventually function as an early-warning system for societies, identifying dangerous structural pressures and allowing governments to intervene before instability turns into collapse.

Key takeaways

History may contain measurable recurring patterns, rather than being entirely a sequence of unique events.
Cliodynamics combines history + mathematics + statistics + complexity science + big data.
Social instability tends to rise when inequality, elite competition, popular hardship and state weakness reinforce one another.
The goal is not exact prophecy, but something closer to a “weather forecast” for political and social instability.
The deepest question raised by the article is whether understanding historical cycles can help societies change their trajectory rather than simply repeat them.

ARTICLE / ARTICLE [PDF]]]> Author: Laura Spinney
Publication:The Guardian
Publication date: 12 November 2019

The article explores cliodynamics, an emerging discipline that treats history as a vast data set and uses mathematics, statistics and computer modelling to search for recurring patterns in the rise and decline of societies. Its central figure is Peter Turchin, originally a mathematical biologist, who argues that social systems can be studied much like ecological systems. His models suggest that societies often experience long “secular cycles” of prosperity and instability, driven by interacting factors such as population pressure, declining living standards, competition among elites, inequality and weakening state finances. These ideas build substantially on the earlier work of Jack Goldstone, who developed a political stress indicator, usually denoted $\Psi$, to represent the combined pressures generated by mass mobilisation, elite competition and fiscal weakness.

A major development behind this approach is the availability of enormous historical databases such as Seshat, which collects quantitative information about hundreds of societies across thousands of years. Researchers can use indirect evidence—coin hoards, skeletal remains, building sizes, wages, demographic records and even environmental proxies—to reconstruct variables that cannot be measured directly. Turchin argues that such data reveal recurring long-term cycles as well as shorter roughly 50-year “fathers-and-sons” oscillations in political violence. Applied to the United States, his models showed rising structural political stress from around the 1970s onward, which led him years in advance to identify the period around 2020 as one of elevated instability.

The article nevertheless emphasizes that cliodynamics is probabilistic rather than deterministic. It cannot predict the exact event that triggers a revolution or crisis; instead, it attempts to measure whether a society has become structurally vulnerable, in much the same way that meteorology estimates the probability of severe weather. Critics—particularly many traditional historians—argue that human behaviour is too contingent and culturally specific to be captured reliably by equations, and that large historical databases may reproduce biases or strip evidence of its context. Turchin's more ambitious claim is therefore not that mathematics can foretell history, but that quantitative models might eventually function as an early-warning system for societies, identifying dangerous structural pressures and allowing governments to intervene before instability turns into collapse.

Key takeaways

History may contain measurable recurring patterns, rather than being entirely a sequence of unique events.
Cliodynamics combines history + mathematics + statistics + complexity science + big data.
Social instability tends to rise when inequality, elite competition, popular hardship and state weakness reinforce one another.
The goal is not exact prophecy, but something closer to a “weather forecast” for political and social instability.
The deepest question raised by the article is whether understanding historical cycles can help societies change their trajectory rather than simply repeat them.

ARTICLE / ARTICLE [PDF]]]> <![CDATA[Bayes theorem]]> https://mklab.gr/showthread.php?tid=1849 Fri, 04 Sep 2026 04:24:41 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1849
Bayes’ theorem is a fundamental result in probability theory that describes how to update the probability of a hypothesis when new evidence becomes available. If $A$ represents a hypothesis and $B$ represents observed evidence, then
$P(A\mid B)=\frac{P(B\mid A)P(A)}{P(B)}$
where $P(A)$ is the prior probability of $A$, $P(B\mid A)$ is the likelihood of observing $B$ assuming $A$ is true, and $P(A\mid B)$ is the posterior probability after incorporating the evidence. The theorem follows directly from the definition of conditional probability and the identity
$P(A\cap B)=P(A\mid B)P(B)=P(B\mid A)P(A)$.

The importance of Bayes’ theorem lies in its ability to reverse conditional probabilities. Knowing, for example, how likely a positive medical test is when a patient has a disease does not immediately tell us how likely the patient is to have the disease after testing positive. Bayes’ theorem combines the test's accuracy with the disease's underlying prevalence to obtain that probability. This distinction is particularly important when dealing with rare events, because even a highly accurate test can produce a substantial proportion of false positives when the prior probability of the condition is very small.

The theorem is named after Thomas Bayes, whose work on conditional probability was published posthumously in 1763, although Pierre-Simon Laplace independently developed and greatly extended the approach. Today Bayes’ theorem forms the mathematical foundation of Bayesian inference, where beliefs about unknown parameters or competing hypotheses are repeatedly updated as new data arrive. Its applications extend across statistics, machine learning, medical diagnosis, genetics, cryptanalysis, decision theory, and many other areas involving reasoning under uncertainty.

Key takeaways

Prior + evidence → posterior: Bayes’ theorem provides a systematic mathematical rule for updating probabilities.
$P(A\mid B)\neq P(B\mid A)$: confusing these two conditional probabilities is a common error.
Base rates matter: rare events can remain relatively unlikely even after apparently strong evidence.
Bayes’ theorem is one of the central mathematical tools behind Bayesian statistics and probabilistic machine learning.

ARTICLE / ARTICLE [PDF]]]>
Bayes’ theorem is a fundamental result in probability theory that describes how to update the probability of a hypothesis when new evidence becomes available. If $A$ represents a hypothesis and $B$ represents observed evidence, then
$P(A\mid B)=\frac{P(B\mid A)P(A)}{P(B)}$
where $P(A)$ is the prior probability of $A$, $P(B\mid A)$ is the likelihood of observing $B$ assuming $A$ is true, and $P(A\mid B)$ is the posterior probability after incorporating the evidence. The theorem follows directly from the definition of conditional probability and the identity
$P(A\cap B)=P(A\mid B)P(B)=P(B\mid A)P(A)$.

The importance of Bayes’ theorem lies in its ability to reverse conditional probabilities. Knowing, for example, how likely a positive medical test is when a patient has a disease does not immediately tell us how likely the patient is to have the disease after testing positive. Bayes’ theorem combines the test's accuracy with the disease's underlying prevalence to obtain that probability. This distinction is particularly important when dealing with rare events, because even a highly accurate test can produce a substantial proportion of false positives when the prior probability of the condition is very small.

The theorem is named after Thomas Bayes, whose work on conditional probability was published posthumously in 1763, although Pierre-Simon Laplace independently developed and greatly extended the approach. Today Bayes’ theorem forms the mathematical foundation of Bayesian inference, where beliefs about unknown parameters or competing hypotheses are repeatedly updated as new data arrive. Its applications extend across statistics, machine learning, medical diagnosis, genetics, cryptanalysis, decision theory, and many other areas involving reasoning under uncertainty.

Key takeaways

Prior + evidence → posterior: Bayes’ theorem provides a systematic mathematical rule for updating probabilities.
$P(A\mid B)\neq P(B\mid A)$: confusing these two conditional probabilities is a common error.
Base rates matter: rare events can remain relatively unlikely even after apparently strong evidence.
Bayes’ theorem is one of the central mathematical tools behind Bayesian statistics and probabilistic machine learning.

ARTICLE / ARTICLE [PDF]]]> <![CDATA[Gambler's fallacy]]> https://mklab.gr/showthread.php?tid=1797 Thu, 03 Sep 2026 02:14:35 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1797
The gambler’s fallacy is the mistaken belief that past outcomes of independent random events influence what will happen next. For example, after a fair coin lands heads several times in a row, someone may believe that tails is now “due.” In reality, each toss is independent, so the probability remains
$P(heads)=P(tails)=12.P(\text{heads})=P(\text{tails})=\frac12$.
Likewise, if four heads have already occurred, the probability that the fifth toss is heads is still $1/2$. The confusion comes from mixing up the probability of predicting an entire sequence beforehand with the probability of the next event after part of the sequence has already occurred. Five consecutive heads have probability $1/2^5=1/32$ before the experiment begins, but once four heads have already occurred, the probability of another head is simply $1/2$.

The fallacy is also called the Monte Carlo fallacy, after a famous roulette event at the Monte Carlo Casino on August 18, 1913. The ball reportedly landed on black 26 times consecutively, leading gamblers to bet increasingly large sums on red because they believed red had to appear soon. But if the roulette wheel was unbiased, each new spin remained independent of the preceding spins. The psychological explanation is closely associated with what Kahneman and Tversky called the representativeness heuristic: people expect even short random sequences to look balanced, although genuine randomness naturally produces streaks and clusters.

Importantly, the gambler’s fallacy applies only when events really are independent and probabilities remain unchanged. Drawing cards without replacement is different: after an ace is removed from a deck, the probability of drawing another ace genuinely changes. Similarly, an extraordinary run of identical results might provide evidence that a coin, roulette wheel, or other mechanism is biased; in that case, updating probabilities based on the observations can be rational rather than fallacious.

Key takeaways

Independent random events do not remember previous outcomes.
A long streak does not make the opposite outcome “due.”
Random sequences naturally contain surprisingly long streaks.
The law of large numbers does not require short-term imbalances to be immediately corrected.
Past outcomes matter when events are dependent, probabilities change, or observations provide evidence that the underlying process is biased.

ARTICLE]]>
The gambler’s fallacy is the mistaken belief that past outcomes of independent random events influence what will happen next. For example, after a fair coin lands heads several times in a row, someone may believe that tails is now “due.” In reality, each toss is independent, so the probability remains
$P(heads)=P(tails)=12.P(\text{heads})=P(\text{tails})=\frac12$.
Likewise, if four heads have already occurred, the probability that the fifth toss is heads is still $1/2$. The confusion comes from mixing up the probability of predicting an entire sequence beforehand with the probability of the next event after part of the sequence has already occurred. Five consecutive heads have probability $1/2^5=1/32$ before the experiment begins, but once four heads have already occurred, the probability of another head is simply $1/2$.

The fallacy is also called the Monte Carlo fallacy, after a famous roulette event at the Monte Carlo Casino on August 18, 1913. The ball reportedly landed on black 26 times consecutively, leading gamblers to bet increasingly large sums on red because they believed red had to appear soon. But if the roulette wheel was unbiased, each new spin remained independent of the preceding spins. The psychological explanation is closely associated with what Kahneman and Tversky called the representativeness heuristic: people expect even short random sequences to look balanced, although genuine randomness naturally produces streaks and clusters.

Importantly, the gambler’s fallacy applies only when events really are independent and probabilities remain unchanged. Drawing cards without replacement is different: after an ace is removed from a deck, the probability of drawing another ace genuinely changes. Similarly, an extraordinary run of identical results might provide evidence that a coin, roulette wheel, or other mechanism is biased; in that case, updating probabilities based on the observations can be rational rather than fallacious.

Key takeaways

Independent random events do not remember previous outcomes.
A long streak does not make the opposite outcome “due.”
Random sequences naturally contain surprisingly long streaks.
The law of large numbers does not require short-term imbalances to be immediately corrected.
Past outcomes matter when events are dependent, probabilities change, or observations provide evidence that the underlying process is biased.

ARTICLE]]> <![CDATA[Bell number]]> https://mklab.gr/showthread.php?tid=1780 Tue, 01 Sep 2026 23:55:14 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1780
The Bell numbers $B_n$ form an important sequence in combinatorics. They count the number of ways an $n$-element set can be divided into nonempty, disjoint subsets. In other words, $B_n$ gives the total number of possible partitions of a set, where the order of the subsets does not matter.
The sequence begins
$B_0=1,\quad B_1=1,\quad B_2=2,\quad B_3=5,\quad B_4=15,\quad B_5=52,\quad B_6=203,\ldots$
For example, the set ${a,b,c}$ has exactly five possible partitions, so $B_3=5$. Bell numbers also count the number of possible equivalence relations on a set containing $n$ elements.

Bell numbers are closely connected with the Stirling numbers of the second kind. If $S(n,k)$ denotes the number of ways to partition a set of $n$ elements into exactly $k$ nonempty subsets, then
$B_n=\sum_{k=0}^{n}S(n,k)$.
They also satisfy the recurrence relation
$B_{n+1}=\sum_{k=0}^{n}\binom{n}{k}B_k$.
Their exponential generating function is
$\sum_{n=0}^{\infty}\frac{B_n}{n!}x^n=e^{e^x-1}$.

These formulas show the close relationship between Bell numbers, set partitions, Stirling numbers and generating functions. Bell numbers grow very rapidly as $n$ increases, and their asymptotic behaviour can also be described using the Lambert $W$ function.
The numbers are named after the mathematician Eric Temple Bell, who studied them during the 1930s, although the underlying combinatorial ideas appeared much earlier.
An interesting historical example comes from Japan. A traditional incense game associated with The Tale of Genji involves five groups and produces exactly $B_5=52$ possible patterns, corresponding to the 52 possible partitions of a five-element set.

Key takeaways

Definition: $B_n$ is the number of partitions of an $n$-element set.
First values: $1,1,2,5,15,52,203,877,4140,\ldots$
Connection with Stirling numbers: $B_n=\sum_{k=0}^{n}S(n,k)$.
Recurrence relation: $B_{n+1}=\sum_{k=0}^{n}\binom{n}{k}B_k$.
Generating function: $\sum_{n=0}^{\infty}\frac{B_n}{n!}x^n=e^{e^x-1}$.
Area of mathematics: mainly combinatorics and discrete mathematics, with connections to probability, number theory and analytic combinatorics.

ARTICLE]]>
The Bell numbers $B_n$ form an important sequence in combinatorics. They count the number of ways an $n$-element set can be divided into nonempty, disjoint subsets. In other words, $B_n$ gives the total number of possible partitions of a set, where the order of the subsets does not matter.
The sequence begins
$B_0=1,\quad B_1=1,\quad B_2=2,\quad B_3=5,\quad B_4=15,\quad B_5=52,\quad B_6=203,\ldots$
For example, the set ${a,b,c}$ has exactly five possible partitions, so $B_3=5$. Bell numbers also count the number of possible equivalence relations on a set containing $n$ elements.

Bell numbers are closely connected with the Stirling numbers of the second kind. If $S(n,k)$ denotes the number of ways to partition a set of $n$ elements into exactly $k$ nonempty subsets, then
$B_n=\sum_{k=0}^{n}S(n,k)$.
They also satisfy the recurrence relation
$B_{n+1}=\sum_{k=0}^{n}\binom{n}{k}B_k$.
Their exponential generating function is
$\sum_{n=0}^{\infty}\frac{B_n}{n!}x^n=e^{e^x-1}$.

These formulas show the close relationship between Bell numbers, set partitions, Stirling numbers and generating functions. Bell numbers grow very rapidly as $n$ increases, and their asymptotic behaviour can also be described using the Lambert $W$ function.
The numbers are named after the mathematician Eric Temple Bell, who studied them during the 1930s, although the underlying combinatorial ideas appeared much earlier.
An interesting historical example comes from Japan. A traditional incense game associated with The Tale of Genji involves five groups and produces exactly $B_5=52$ possible patterns, corresponding to the 52 possible partitions of a five-element set.

Key takeaways

Definition: $B_n$ is the number of partitions of an $n$-element set.
First values: $1,1,2,5,15,52,203,877,4140,\ldots$
Connection with Stirling numbers: $B_n=\sum_{k=0}^{n}S(n,k)$.
Recurrence relation: $B_{n+1}=\sum_{k=0}^{n}\binom{n}{k}B_k$.
Generating function: $\sum_{n=0}^{\infty}\frac{B_n}{n!}x^n=e^{e^x-1}$.
Area of mathematics: mainly combinatorics and discrete mathematics, with connections to probability, number theory and analytic combinatorics.

ARTICLE]]> <![CDATA[Benford's law]]> https://mklab.gr/showthread.php?tid=1733 Sun, 23 Aug 2026 23:18:13 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1733 Benford’s Law
The Strange Mathematics of First Digits Benford’s law, also known as the Newcomb–Benford law or the first-digit law, is a remarkable mathematical phenomenon concerning the frequency with which digits appear at the beginning of numbers in many real-world datasets.
One might naturally expect the digits 1 through 9 to appear as the first digit with approximately equal probability. If that were true, each digit would occur about $11.1%$ of the time.
Surprisingly, this is often not what happens.
In many naturally occurring collections of numbers, values beginning with 1 appear much more frequently than values beginning with 9.

The Law
According to Benford’s law, the probability that the first significant digit of a number is $d$ is

$P(d)=\log_{10}\left(1+\frac{1}{d}\right)$

where

$d=1,2,\ldots,9$

For example,

$P(1)=\log_{10}(2)\approx0.301$

so approximately 30.1% of the numbers in a Benford-distributed dataset begin with the digit 1.
For the digit 9,

$P(9)=\log_{10}\left(\frac{10}{9}\right)\approx0.046$

so only about 4.6% begin with 9.
This means that numbers beginning with 1 can occur roughly six times as often as numbers beginning with 9.

First-Digit Probabilities
1 → 30.1%
2 → 17.6%
3 → 12.5%
4 → 9.7%
5 → 7.9%
6 → 6.7%
7 → 5.8%
8 → 5.1%
9 → 4.6%
The probability steadily decreases as the leading digit becomes larger.

Why Does This Happen?
The explanation is closely related to logarithmic scales.
On a logarithmic scale, the interval occupied by numbers beginning with 1 is considerably larger than the interval occupied by numbers beginning with 9.
For example, numbers with leading digit 1 occupy the logarithmic interval from

$\log_{10}(1)$ to $\log_{10}(2)$

whose length is

$\log_{10}(2)-\log_{10}(1)=\log_{10}(2)\approx0.301.$

Numbers beginning with 9 occupy only the interval from

$\log_{10}(9)$ to $\log_{10}(10)$

whose length is approximately

$0.046.$

Thus, if the logarithms of the values are distributed approximately uniformly, Benford’s law appears naturally.

Where Does Benford’s Law Appear?
The law tends to work particularly well for datasets that span several orders of magnitude.
Examples can include:
Population figures
Financial and accounting data
Company revenues
Geographical measurements
Physical quantities
Economic statistics
Scientific measurements
Certain mathematical sequences
Interestingly, some purely mathematical sequences also approach Benford’s distribution.
Examples include the Fibonacci numbers, factorials and powers of 2.

A Historical Curiosity
The phenomenon was first noticed by the astronomer and mathematician Simon Newcomb in 1881.
Newcomb noticed something peculiar about books containing logarithm tables.
The pages containing logarithms of numbers beginning with small digits—especially 1—were considerably more worn than pages corresponding to numbers beginning with larger digits.
He reasoned that people must therefore be looking up numbers beginning with 1 much more frequently than numbers beginning with 9.
The observation was largely forgotten.
More than fifty years later, physicist Frank Benford independently rediscovered the phenomenon.
In 1938, Benford published a large investigation involving more than 20,000 numerical observations taken from many different sources.
The phenomenon subsequently became known as Benford’s law.

Fraud Detection
One of the most fascinating modern applications of Benford’s law is in forensic accounting and fraud detection.
Suppose that a large collection of financial transactions would normally be expected to follow Benford’s law.
An auditor can compare the actual frequencies of the first digits with the theoretical frequencies predicted by Benford’s distribution.
Large or systematic deviations may identify data that deserve further investigation.
For this reason, Benford analysis has been used in areas such as:
Accounting audits
Tax investigations
Financial fraud detection
Economic statistics
Scientific datasets
Election-data analysis
However, there is an extremely important limitation.
Failure to follow Benford’s law is not proof of fraud.
It merely indicates that the dataset may deserve closer examination.

When Benford’s Law Does NOT Apply
Not every collection of numbers should follow Benford’s law.
It generally performs poorly when numbers are artificially restricted to a narrow interval or assigned according to human-designed systems.
Examples include:
Human heights
IQ scores
Telephone numbers
Postal codes
Identification numbers
Sequential invoice numbers
Numbers with predetermined minimum or maximum values
For example, the heights of adults might mostly lie between roughly 150 and 200 centimetres. Such values do not span several orders of magnitude, so there is no reason to expect them to follow Benford’s law.
This limitation is particularly important when Benford analysis is used to make claims about fraud or manipulation.

Why Is Benford’s Law So Interesting?
Benford’s law is fascinating because it demonstrates that something as apparently arbitrary as the first digit of a number can exhibit a strong mathematical pattern.
It connects several areas of mathematics and statistics, including:
Probability theory
Mathematical statistics
Number theory
Logarithms
Data analysis
Forensic statistics
Perhaps most surprisingly, the law shows that in many datasets the digits 1 through 9 are far from equally likely.
The humble digit 1 appears at the beginning of numbers approximately one-third of the time.

Key Takeaways
1. In many naturally generated datasets, first digits are not uniformly distributed.
2. About 30.1% of Benford-distributed numbers begin with 1.
3. Only about 4.6% begin with 9.
4. The distribution is described by

$P(d)=\log_{10}\left(1+\frac{1}{d}\right).$

5. The phenomenon is fundamentally connected with logarithmic scales.
6. Benford’s law is useful for detecting statistical anomalies, particularly in financial data.
7. A deviation from Benford’s law is not, by itself, evidence of fraud.

Source:
ARTICLE / ARTICLE [PDF]]]> Benford’s Law
The Strange Mathematics of First Digits Benford’s law, also known as the Newcomb–Benford law or the first-digit law, is a remarkable mathematical phenomenon concerning the frequency with which digits appear at the beginning of numbers in many real-world datasets.
One might naturally expect the digits 1 through 9 to appear as the first digit with approximately equal probability. If that were true, each digit would occur about $11.1%$ of the time.
Surprisingly, this is often not what happens.
In many naturally occurring collections of numbers, values beginning with 1 appear much more frequently than values beginning with 9.

The Law
According to Benford’s law, the probability that the first significant digit of a number is $d$ is

$P(d)=\log_{10}\left(1+\frac{1}{d}\right)$

where

$d=1,2,\ldots,9$

For example,

$P(1)=\log_{10}(2)\approx0.301$

so approximately 30.1% of the numbers in a Benford-distributed dataset begin with the digit 1.
For the digit 9,

$P(9)=\log_{10}\left(\frac{10}{9}\right)\approx0.046$

so only about 4.6% begin with 9.
This means that numbers beginning with 1 can occur roughly six times as often as numbers beginning with 9.

First-Digit Probabilities
1 → 30.1%
2 → 17.6%
3 → 12.5%
4 → 9.7%
5 → 7.9%
6 → 6.7%
7 → 5.8%
8 → 5.1%
9 → 4.6%
The probability steadily decreases as the leading digit becomes larger.

$\log_{10}(1)$ to $\log_{10}(2)$

whose length is

$\log_{10}(2)-\log_{10}(1)=\log_{10}(2)\approx0.301.$

Numbers beginning with 9 occupy only the interval from

$\log_{10}(9)$ to $\log_{10}(10)$

whose length is approximately

$0.046.$

Thus, if the logarithms of the values are distributed approximately uniformly, Benford’s law appears naturally.

$P(d)=\log_{10}\left(1+\frac{1}{d}\right).$

Source:
ARTICLE / ARTICLE [PDF]]]> <![CDATA[Law of the unconscious statistician]]> https://mklab.gr/showthread.php?tid=1546 Mon, 10 Aug 2026 14:40:36 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1546 Law of the unconscious statistician

Summary

The Law of the Unconscious Statistician (LOTUS) is a fundamental result in probability and statistics that allows us to calculate the expected value of a function of a random variable directly from the probability distribution of the original variable, without first finding the distribution of the transformed variable.

For a discrete random variable $X$, it states that $\operatorname{E}[g(X)] = \sum_x g(x)p_X(x)$, while for a continuous random variable it becomes $\operatorname{E}[g(X)] = \int_{-\infty}^{\infty} g(x)f_X(x),dx$. The law also extends to multiple random variables, vectors, and more general settings using measure theory, making it a powerful and widely applicable tool in probability.

ARTICLE]]> Law of the unconscious statistician

Summary

The Law of the Unconscious Statistician (LOTUS) is a fundamental result in probability and statistics that allows us to calculate the expected value of a function of a random variable directly from the probability distribution of the original variable, without first finding the distribution of the transformed variable.

For a discrete random variable $X$, it states that $\operatorname{E}[g(X)] = \sum_x g(x)p_X(x)$, while for a continuous random variable it becomes $\operatorname{E}[g(X)] = \int_{-\infty}^{\infty} g(x)f_X(x),dx$. The law also extends to multiple random variables, vectors, and more general settings using measure theory, making it a powerful and widely applicable tool in probability.

ARTICLE]]> <![CDATA[Freshman's dream]]> https://mklab.gr/showthread.php?tid=1545 Mon, 10 Aug 2026 14:38:42 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1545 Freshman's dream

Summary

The Freshman’s Dream is a generally false mathematical rule that incorrectly assumes powers distribute over addition, written as $(x+y)^n=x^n+y^n$. It is a common mistake made by beginning students, because the correct expansion usually contains additional terms, as shown by the binomial theorem; for example, $(x+y)^2=x^2+2xy+y^2$, not $x^2+y^2$.

However, the identity is genuinely valid in certain mathematical settings, particularly in commutative rings of prime characteristic $p$, where $(x+y)^p=x^p+y^p$ because the intermediate binomial coefficients vanish modulo $p$. The article also discusses special cases where the formula happens to hold, its connection to the Frobenius endomorphism, and the historical development of the term “Freshman’s Dream.”

ARTICLE]]> Freshman's dream

Summary

The Freshman’s Dream is a generally false mathematical rule that incorrectly assumes powers distribute over addition, written as $(x+y)^n=x^n+y^n$. It is a common mistake made by beginning students, because the correct expansion usually contains additional terms, as shown by the binomial theorem; for example, $(x+y)^2=x^2+2xy+y^2$, not $x^2+y^2$.

However, the identity is genuinely valid in certain mathematical settings, particularly in commutative rings of prime characteristic $p$, where $(x+y)^p=x^p+y^p$ because the intermediate binomial coefficients vanish modulo $p$. The article also discusses special cases where the formula happens to hold, its connection to the Frobenius endomorphism, and the historical development of the term “Freshman’s Dream.”

ARTICLE]]> <![CDATA[Buffon's needle problem]]> https://mklab.gr/showthread.php?tid=1434 Thu, 30 Jul 2026 03:02:21 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1434 [Image: images?q=tbn:ANd9GcT8usspwi2cZFvo7fOsjbd...epNnI&s=10]

[Image: images?q=tbn:ANd9GcT8usspwi2cZFvo7fOsjbd...epNnI&s=10]

Buffon's needle problem

Summary

Buffon's needle problem is a classic question in probability theory—first posed by Georges-Louis Leclerc, Comte de Buffon, in the 18th century—that asks for the likelihood that a needle of length $l$, when dropped randomly onto a floor with parallel lines spaced $t$ units apart, will land across one of the lines.

As one of the earliest solved problems in geometric probability, its solution reveals that when the needle is shorter than or equal to the line spacing ($l \le t$), the probability of a line-crossing is $P = \frac{2l}{t\pi}$, where the appearance of $\pi$ stems from the uniform rotational symmetry of the needle's landing angle. Consequently, repeatedly dropping needles and recording how many cross a line provides a practical, physical Monte Carlo method for experimentally estimating the value of $\pi$.

ARTICLE]]> <![CDATA[Szemerédi's theorem]]> https://mklab.gr/showthread.php?tid=1394 Wed, 29 Jul 2026 00:21:11 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1394 Szemerédi's theorem

Summary

Szemerédi's theorem is a fundamental result in arithmetic combinatorics, originally conjectured by Paul Erdős and Paul Turán in 1936 and proved by Hungarian mathematician Endre Szemerédi in 1975. The theorem states that any subset of the natural numbers with positive upper density (meaning it contains a non-zero proportion of the integers as the set grows infinitely) contains an arithmetic progression of length $k$ for every positive integer $k$.

Beyond its primary statement, the result is famous for driving deep mathematical connections; distinct proofs were later established using combinatorics, ergodic theory, and Fourier analysis, earning the theorem a reputation as a "Rosetta stone" linking disparate areas of mathematics and inspiring major breakthroughs like the Green–Tao theorem on prime numbers.

ARTICLE]]> Szemerédi's theorem

Summary

Szemerédi's theorem is a fundamental result in arithmetic combinatorics, originally conjectured by Paul Erdős and Paul Turán in 1936 and proved by Hungarian mathematician Endre Szemerédi in 1975. The theorem states that any subset of the natural numbers with positive upper density (meaning it contains a non-zero proportion of the integers as the set grows infinitely) contains an arithmetic progression of length $k$ for every positive integer $k$.

Beyond its primary statement, the result is famous for driving deep mathematical connections; distinct proofs were later established using combinatorics, ergodic theory, and Fourier analysis, earning the theorem a reputation as a "Rosetta stone" linking disparate areas of mathematics and inspiring major breakthroughs like the Green–Tao theorem on prime numbers.

ARTICLE]]> <![CDATA[Ramsey's theorem]]> https://mklab.gr/showthread.php?tid=1392 Wed, 29 Jul 2026 00:13:03 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1392
Summary

Ramsey's theorem is a foundational result in combinatorics that guarantees the emergence of order within large systems, often summarized by the idea that "complete disorder is impossible." In graph theory, it states that if you color the edges of a sufficiently large complete graph with a fixed number of colors, you are guaranteed to find a complete subgraph whose edges are all a single color (a monochromatic clique).

The smallest number of vertices needed to guarantee such a pattern is called a Ramsey number (denoted as $R(r, s)$ for two colors); a popular example is the "theorem on friends and strangers" ($R(3,3)=6$), which shows that in any group of six people, there must be at least three mutual acquaintances or three total strangers. Proved by Frank P. Ramsey in 1930, the theorem laid the groundwork for Ramsey theory, though calculating the exact values of larger Ramsey numbers remains one of the hardest open problems in modern mathematics.

ARTICLE]]>
Summary

Ramsey's theorem is a foundational result in combinatorics that guarantees the emergence of order within large systems, often summarized by the idea that "complete disorder is impossible." In graph theory, it states that if you color the edges of a sufficiently large complete graph with a fixed number of colors, you are guaranteed to find a complete subgraph whose edges are all a single color (a monochromatic clique).

The smallest number of vertices needed to guarantee such a pattern is called a Ramsey number (denoted as $R(r, s)$ for two colors); a popular example is the "theorem on friends and strangers" ($R(3,3)=6$), which shows that in any group of six people, there must be at least three mutual acquaintances or three total strangers. Proved by Frank P. Ramsey in 1930, the theorem laid the groundwork for Ramsey theory, though calculating the exact values of larger Ramsey numbers remains one of the hardest open problems in modern mathematics.

ARTICLE]]> <![CDATA[Sperner's lemma]]> https://mklab.gr/showthread.php?tid=1387 Tue, 28 Jul 2026 23:56:51 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1387

Sperner's lemma

Summary

Sperner's lemma is a combinatorial theorem in mathematics that concerns the colorings of triangulations on simplices, stating that any valid Sperner coloring of a triangulated $n$-dimensional simplex must contain an odd number of fully labeled sub-simplices whose vertices all possess distinct colors.

Proved by Emanuel Sperner in 1928, this lemma is widely recognized for its application in algebraic topology, where it serves as a combinatorial equivalent to the Brouwer fixed-point theorem and is used to guarantee the existence of fixed points in continuous functions.

ARTICLE]]> <![CDATA[Lindley equation]]> https://mklab.gr/showthread.php?tid=1384 Tue, 28 Jul 2026 23:38:49 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1384 Lindley equation

Summary

The Lindley equation (or Lindley recursion) is a discrete-time stochastic process used in probability and queueing theory to model dynamic systems over time, most notably the waiting time of customers in a single-server queue with a First-In, First-Out (FIFO) service discipline. Formally expressed as $W_{n+1} = \max(0, W_n + U_n)$, where $W_n$ represents the waiting time of the $n$-th customer and $U_n$ is the difference between service time and inter-arrival time, it captures how a customer's wait depends on whether the previous customer finished serving before the next arrived.

First introduced by Dennis Lindley in 1952, the concept extends to tracking queue lengths and yields Lindley's integral equation, which helps determine stationary waiting time distributions in $G/G/1$ queues using mathematical techniques like the Wiener–Hopf method.

ARTICLE]]> Lindley equation

Summary

The Lindley equation (or Lindley recursion) is a discrete-time stochastic process used in probability and queueing theory to model dynamic systems over time, most notably the waiting time of customers in a single-server queue with a First-In, First-Out (FIFO) service discipline. Formally expressed as $W_{n+1} = \max(0, W_n + U_n)$, where $W_n$ represents the waiting time of the $n$-th customer and $U_n$ is the difference between service time and inter-arrival time, it captures how a customer's wait depends on whether the previous customer finished serving before the next arrived.

First introduced by Dennis Lindley in 1952, the concept extends to tracking queue lengths and yields Lindley's integral equation, which helps determine stationary waiting time distributions in $G/G/1$ queues using mathematical techniques like the Wiener–Hopf method.

ARTICLE]]> <![CDATA[Combinatorics]]> https://mklab.gr/showthread.php?tid=1383 Tue, 28 Jul 2026 23:33:46 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1383 Combinatorics: The Mathematics of Fair Thieves and Sophisticated Forgetters

Summary

In his article for Frontiers for Young Minds, mathematician Noga Alon highlights the beauty, objectivity, and real-world relevance of combinatorics—the study of finite mathematical structures—by showing how it helps solve everyday problems. Using engaging examples, Alon illustrates how mathematical principles govern complex systems, such as Ramsey’s theorem demonstrating that large social networks naturally contain organized subgroups of friends or strangers, and the "necklace splitting problem" showing how a decorated necklace can be divided fairly between thieves using a minimal number of cuts.

Additionally, he explains how modern combinatorics helps computer scientists analyze massive, continuous data streams when memory space is extremely limited—a concept known as streaming algorithms—showing that math is not only a logical and unchanging form of art, but also a vital tool for understanding society and technology.

ARTICLE]]> Combinatorics: The Mathematics of Fair Thieves and Sophisticated Forgetters

Summary

In his article for Frontiers for Young Minds, mathematician Noga Alon highlights the beauty, objectivity, and real-world relevance of combinatorics—the study of finite mathematical structures—by showing how it helps solve everyday problems. Using engaging examples, Alon illustrates how mathematical principles govern complex systems, such as Ramsey’s theorem demonstrating that large social networks naturally contain organized subgroups of friends or strangers, and the "necklace splitting problem" showing how a decorated necklace can be divided fairly between thieves using a minimal number of cuts.

Additionally, he explains how modern combinatorics helps computer scientists analyze massive, continuous data streams when memory space is extremely limited—a concept known as streaming algorithms—showing that math is not only a logical and unchanging form of art, but also a vital tool for understanding society and technology.

ARTICLE]]> <![CDATA[Lonely runner conjecture]]> https://mklab.gr/showthread.php?tid=1299 Sat, 25 Jul 2026 06:03:30 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1299 [Image: VJQHF44ItV0EbRHRk6o-ytj6O1NBpr4y5Yi5cLcr...C4nn4XW=s0]

[Image: VJQHF44ItV0EbRHRk6o-ytj6O1NBpr4y5Yi5cLcr...C4nn4XW=s0]

Lonely runner conjecture

Summary

The Lonely Runner Conjecture is a famous unsolved problem in number theory and combinatorics that asks whether, for any group of runners moving at distinct constant speeds around a circular track, each runner will eventually find a moment when they are at least ($1/n$) of the track away from every other runner, where (n) is the total number of runners. First proposed by Jörg Wills in 1967 and later connected to geometric view-obstruction problems, the conjecture has become one of the most intriguing open questions in modern mathematics.

Although its statement is simple and easy to visualise, proving it in full has proved remarkably difficult. The problem has deep connections to Diophantine approximation, graph theory, geometry, and combinatorics, making it important far beyond its intuitive running analogy.

The conjecture has been completely verified for up to 13 runners, with recent computer-assisted proofs extending the known cases, but the general case remains unresolved. Over the years, mathematicians have developed numerous equivalent formulations, partial results, and specialised proofs, yet a universal proof continues to elude researchers. Its combination of an elementary statement and profound mathematical depth has made it one of the best-known open problems in discrete mathematics and number theory.

ARTICLE]]> [Image: VJQHF44ItV0EbRHRk6o-ytj6O1NBpr4y5Yi5cLcr...C4nn4XW=s0]