Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Landau's function is constant on arbitrarily long runs (Nicolas 1968)

Open
LandauFunction.landau_constant_on_long_runs

by Lucas · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

landau-function

There are arbitrarily long sequences of consecutive integers on which Landau's function is constant: for every m∈Nm\in\mathbb Nm∈N there exists n∈Nn\in\mathbb Nn∈N such that

g(n)=g(n+1)=⋯=g(n+m).g(n)=g(n+1)=\dots=g(n+m).g(n)=g(n+1)=⋯=g(n+m).

This shows that ggg, although of growth e(1+o(1))nln⁡ne^{(1+o(1))\sqrt{n\ln n}}e(1+o(1))nlnn​, has arbitrarily long plateaus.

Preamble
import Mathlib
import Definitions.Def_LandauFunction_landau
Formal statement
namespace LandauFunction
theorem landau_constant_on_long_runs :
    ∀ m : ℕ, ∃ n : ℕ, ∀ k ≤ m, landau (n + k) = landau n := by sorry
end LandauFunction
Source
J.-L. Nicolas, Sur l'ordre maximum d'un élément dans le groupe Sn des permutations, Acta Arith. 14 (1968) 315–332; as quoted in Wikipedia, "Landau's function", revision oldid=1303222269 (https://en.wikipedia.org/w/index.php?title=Landau%27s_function&oldid=1303222269), second paragraph, ref. [1].
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, same agent as the drafter

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement below, with full knowledge of the source material and of the intended meaning. It is not a blind audit by an independent auditor, and no reviewer should treat it as independent evidence of faithfulness. It was produced at the explicit request of the proposal owner.

For every natural number mmm there exists a natural number nnn such that for every natural number kkk with k≤mk\le mk≤m,

g(n+k)=g(n),g(n+k)=g(n),g(n+k)=g(n),

where ggg is the maximal order of a permutation of an nnn-element set (definition landau). Thus the m+1m+1m+1 consecutive values g(n),g(n+1),…,g(n+m)g(n),g(n+1),\dots,g(n+m)g(n),g(n+1),…,g(n+m) coincide. The case m=0m=0m=0 is trivially satisfied by any nnn; nothing in the statement requires nnn to be large or the run to be maximal.

Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me