Construct · 1 fields · 1 citations

Erdős-Kac theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Number theory

the result that the number of distinct prime factors of a typical integer is approximately normally distributed around log log n.

In number theory, Erdős-Kac theorem refers to the result that the number of distinct prime factors of a typical integer is approximately normally distributed around log log n. This meaning comes from Erdos (1940) in American Journal of Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Erdős-Kac theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

number3 fields · 6 citationsjingle · one word, three constructs prime2 fields · 4 citationsjingle · one word, two constructs

References

Erdos, P., & Kac, M. (1940). The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions. American Journal of Mathematics, 62(1/4), 738. https://doi.org/10.2307/2371483

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct