Pál Turán Created 2026-10-14 Updated 2026-11-05
Pál Turán worked in number theory and combinatorics. His1934 proof of the typical size of the number of prime divisors became an important precursor of probabilistic number theory: averaging a counting function can reveal the behaviour of almost all integers without computing it separately for each integer.[ref] In extremal graph theory, the theorem carrying his name asks how many edges force a complete subgraph. The triangle case gives the sharp threshold, attained by a balanced complete bipartite graph.
Figure 1.
Portrait of Pál Turán
. Bundesarchiv, Bild 183-33149-0001 / CC-BY-SA 3.0; photographer unknown. CC BY-SA 3.0, via Wikimedia Commons. Source.
Probabilistic number theory Created 2026-10-06 Updated 2026-11-05
Probabilistic number theory treats an integer chosen uniformly from as a random object and studies the distribution of its arithmetic functions. The distribution changes with , and limit theorems describe the behavior as grows.
For a fixed prime , the probability that divides the chosen integer is , approaching . For finitely many distinct primes, the joint divisibility frequencies similarly approach products of these probabilities. This motivates models of the number of prime factors and helps explain why logarithmic scales and normal distributions appear in integer statistics. Such independence is an asymptotic model with specified ranges, not an assumption valid for every growing collection of primes.