mathematics

Hardy–Ramanujan theorem

Hardy–Ramanujan theorem is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Hardy–Ramanujan theorem rather than just read about it. In short: In mathematics, the Hardy–Ramanujan theorem, proved by Ramanujan and checked by Hardy states that the normal order of the number ω ( n ) {\displaystyle \omega (n)} of distinct prime factors of a number n {\displaystyle n} is log ⁡ log ⁡ n {\displaystyle \log \log n} . Roughly speaking, this means that most numbers have about this number of distinct prime factors.

Key takeaways

Hardy–Ramanujan theorem belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Hardy–Ramanujan theorem to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Hardy–Ramanujan theorem from memory before moving on to harder problems.

Reference excerpt

In mathematics, the Hardy–Ramanujan theorem, proved by Ramanujan and checked by Hardy states that the normal order of the number ω ( n ) {\displaystyle \omega (n)} of distinct prime factors of a number n {\displaystyle n} is log ⁡ log ⁡ n {\displaystyle \log \log n} . Roughly speaking, this means that most numbers have about this number of distinct prime factors.

Precise statement A more precise version states that for every real-valued function ψ ( n ) {\displaystyle \psi (n)} that tends to infinity as n {\displaystyle n} tends to infinity

| ω ( n ) − log ⁡ log ⁡ n | < ψ ( n ) log ⁡ log ⁡ n {\displaystyle |\omega (n)-\log \log n|<\psi (n){\sqrt {\log \log n}}}

or more traditionally

| ω ( n ) − log ⁡ log ⁡ n | < ( log ⁡ log ⁡ n ) 1 2 + ε {\displaystyle |\omega (n)-\log \log n|<{(\log \log n)}^{{\frac {1}{2}}+\varepsilon }} for almost all (all but an infinitesimal proportion of) integers. That is, let g ( x ) {\displaystyle g(x)} be the number of positive integers n {\displaystyle n} less than x {\displaystyle x} for which the above inequality fails: then g ( x ) / x {\displaystyle g(x)/x} converges to zero as x {\displaystyle x} goes to infinity.

History A simple proof to the result was given by Pál Turán, who used the Turán sieve to prove that

∑ n ≤ x | ω ( n ) − log ⁡ log ⁡ x | 2 ≪ x log ⁡ log ⁡ x . {\displaystyle \sum _{n\leq x}|\omega (n)-\log \log x|^{2}\ll x\log \log x.}

Generalizations The same results are true of Ω ( n ) {\displaystyle \Omega (n)} , the number of prime factors of n {\displaystyle n} counted with multiplicity. This theorem is generalized by the Erdős–Kac theorem, which shows that ω ( n ) {\displaystyle \omega (n)} is essentially normally distributed. There are many proofs of this, including the method of moments (Granville & Soundararajan) and Stein's method (Harper). It was shown by Durkan that a modified version of Turán's result allows one to prove the Hardy–Ramanujan Theorem with any even moment.

See also Almost prime Turán–Kubilius inequality

References

Further reading Kuo, Wentang; Liu, Yu-Ru (2008), "The Erdős–Kac theorem and its generalizations", in De Koninck, Jean-Marie; Granville, Andrew; Luca, Florian (eds.), Anatomy of integers. Based on the CRM workshop, Montreal, Canada, March 13--17, 2006, CRM Proceedings and Lecture Notes, vol. 46, Providence, RI: American Mathematical Society, pp. 209–216, ISBN 978-0-8218-4406-9, Zbl 1187.11024 Hildebrand, A. (2001) [1994], "Hardy-Ramanujan theorem", Encyclopedia of Mathematics, EMS Press

Worked examples

Example 1 — a first encounter with Hardy–Ramanujan theorem

Start with the simplest possible case. Write down what Hardy–Ramanujan theorem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Hardy–Ramanujan theorem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Hardy–Ramanujan theorem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Hardy–Ramanujan theorem

In research: Hardy–Ramanujan theorem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Hardy–Ramanujan theorem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Hardy–Ramanujan theorem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Theorems about prime numbers, Theorems in analytic number theory, so understanding it makes those chapters shorter.
In everyday life: Look for Hardy–Ramanujan theorem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Hardy–Ramanujan theorem” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Hardy–Ramanujan theorem in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Hardy–Ramanujan theorem means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Hardy–Ramanujan theorem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Hardy–Ramanujan theorem in simple terms?

Why does Hardy–Ramanujan theorem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Hardy–Ramanujan theorem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Hardy–Ramanujan theorem.