Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LRC for eleven, twelve, thirteen runners (k=10,11,12k=10,11,12k=10,11,12)

Open
LonelyRunnerConjecture.eleven_twelve_thirteen

by LG · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsdiophantine-approximationnumber-theory

The lonely runner conjecture holds for eleven, twelve and thirteen runners, i.e. LRC(10)∧LRC(11)∧LRC(12)\mathrm{LRC}(10)\wedge\mathrm{LRC}(11)\wedge\mathrm{LRC}(12)LRC(10)∧LRC(11)∧LRC(12). This is the current record, extending the computer-assisted finite-checking method.

Formalization Note Stated as LRC 10 ∧ LRC 11 ∧ LRC 12.

Preamble
import Mathlib
import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture

theorem eleven_twelve_thirteen : LRC 10 ∧ LRC 11 ∧ LRC 12 := by sorry

end LonelyRunnerConjecture
Source
T. Sungkawichai, T. Trakulthongchai, Eleven, twelve, and thirteen lonely runners, https://arxiv.org/abs/2604.23906, main theorem.
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 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