The Turan-Kubilius inequality, in probabilistic number theory, bounds the mean-square deviation of an additive complex-valued arithmetic function from its average value, providing a tool for establishing the normal order of such functions. Pal Turan proved a special case in 1934, developing it to simplify the proof of the Hardy-Ramanujan theorem on the normal order of the number of distinct prime divisors of an integer, and Jonas Kubilius generalized the result in 1956 and again in 1964. The inequality remains a standard tool for proving further results in analytic number theory about the typical behavior of additive functions. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Source Turan-Kubilius inequality (Wikipedia)
Proved By
Source Turan-Kubilius inequality (Wikipedia)
Sources
1. Turan-Kubilius inequality (Wikipedia)
In Branch: Number Theory, Lead sentence
uality is a mathematical theorem in probabilistic number theory.
Proved By: Pal Turan, Lead paragraph
The Turán-Kubilius inequality is a mathematical theorem in probabilistic number theory. It is useful for proving results about the
View the Source2. Turan-Kubilius inequality (Wikipedia)
The theorem was proved in a special case in 1934 by Pal TuranView the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.