Papalocal
Loading…
Papalocal · Things
Work

Landau's function

Landau's function is a function which returns the largest least common multiple of any partition of its input.

All 2 facts, and where they come from

Facts

2 facts · 0 confirmed by two sources · 0 cited · 2 from one source

What it is
integer-valued function One source
Named after
Edmund Landau One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2306623640
Described as
function which returns the largest least common multiple of any partition of its input
What it is
integer-valued function
Named after
Edmund Landau
Wikipedias with a page
9

Wikidata item Q967147 (wikidata.org/wiki/Q967147), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1303222269

In mathematics, Landau's function g(n), named after Edmund Landau, is defined for every natural number n to be the largest order of an element of the symmetric group Sn. Equivalently, g(n) is the largest least common multiple (lcm) of any partition of n, or the maximum number of times a permutation of n elements can be recursively applied to itself before it returns to its starting sequence.
For instance, 5 = 2 + 3 and lcm(2,3) = 6. No other partition of 5 yields a bigger lcm, so g(5) = 6. An element of order 6 in the group S5 can be written in cycle notation as (1 2) (3 4 5). Note that the same argument applies to the number 6, that is, g(6) = 6. There are arbitrarily long sequences of consecutive numbers n, n + 1, ..., n + m on which the function g is constant.
The integer sequence g(0) = 1, g(1) = 1, g(2) = 2, g(3) = 3, g(4) = 4, g(5) = 6, g(6) = 6, g(7) = 12, g(8) = 15, ... (sequence A000793 in the OEIS) is named after Edmund Landau, who proved in 1902 that

limn→∞ln⁡(g(n))nln⁡(n)=1
(where ln denotes the natural logarithm). Equivalently (using little-o notation), g(n)=e(1+o(1))nln⁡n.
More precisely,

ln⁡g(n)=nln⁡n(1+ln⁡ln⁡n−12ln⁡n−(ln⁡ln⁡n)2−6ln⁡ln⁡n+98(ln⁡n)2+O((ln⁡ln⁡nln⁡n)3)).
If π(x)−Li⁡(x)=O(R(x)), where π denotes the prime counting function, Li the logarithmic integral function with inverse Li−1, and we may take R(x)=xexp⁡(−c(ln⁡x)3/5(ln⁡ln⁡x)−1/5) for some constant c > 0 by Ford, then

ln⁡g(n)=Li−1(n)+O(R(nln⁡n)ln⁡n).
The statement that

ln⁡g(n)<Li−1(n)
for all sufficiently large n is equivalent to the Riemann hypothesis.
It can be shown that

g(n)≤en/e
with the only equality between the functions at n = 0, and indeed

g(n)≤exp⁡(1.05314nln⁡n).

From the Wikipedia article “Landau's function” (en.wikipedia.org/wiki/Landau's_function), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it