Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The nnn-conjecture (Browkin–Brzeziński)

Open
NConjecture.n_conjecture

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

abc-conjecturenumber-theoryopen-problem

The nnn-conjecture of Browkin and Brzeziński (§2, p. 933), the generalization of the abc conjecture to more than three integers. For every n≥3n\ge 3n≥3 and every ε>0\varepsilon>0ε>0 there exists a constant C>0C>0C>0 (depending only on nnn and ε\varepsilonε) such that every admissible nnn-tuple of integers a=(a1,…,an)a=(a_1,\dots,a_n)a=(a1​,…,an​) — satisfying a1+⋯+an=0a_1+\cdots+a_n=0a1​+⋯+an​=0, gcd⁡(a1,…,an)=1\gcd(a_1,\dots,a_n)=1gcd(a1​,…,an​)=1, and no nonempty proper subsum equal to 000 — obeys

max⁡1≤i≤n∣ai∣ ≤ C rad⁡(a1⋯an) 2n−5+ε.\max_{1\le i\le n}|a_i|\ \le\ C\,\operatorname{rad}(a_1\cdots a_n)^{\,2n-5+\varepsilon}.1≤i≤nmax​∣ai​∣ ≤ Crad(a1​⋯an​)2n−5+ε.

Equivalently, lim sup⁡{Ln}=2n−5\limsup\{L_n\}=2n-5limsup{Ln​}=2n−5 where Ln=log⁡max⁡i∣ai∣/log⁡rad⁡(a1⋯an)L_n=\log\max_i|a_i|/\log\operatorname{rad}(a_1\cdots a_n)Ln​=logmaxi​∣ai​∣/lograd(a1​⋯an​) ranges over all admissible nnn-tuples; the lower bound lim sup⁡{Ln}≥2n−5\limsup\{L_n\}\ge 2n-5limsup{Ln​}≥2n−5 is their proved Theorem 1, so the content of the goal is the upper bound. The case n=3n=3n=3 is the abc conjecture, and every case n≥4n\ge 4n≥4 implies abc.

Formalization Note. The goal is ∀ n ≥ 3, conjAt n, with conjAt and admissible from NConjecture_Defs. The radical reuses Brocard.radical; the exponent 2n−5+ε2n-5+\varepsilon2n−5+ε is real arithmetic.

Preamble
import Mathlib
import Definitions.Def_NConjecture_Defs
Formal statement
namespace NConjecture

theorem n_conjecture (n : ℕ) (hn : 3 ≤ n) : conjAt n := by sorry

end NConjecture
Source
J. Browkin, J. Brzeziński, Some remarks on the abc-conjecture, Math. Comp. 62(206) (1994), 931–939. https://cr.yp.to/bib/1994/browkin.pdf §2 p. 933 (the n-conjecture, conditions (i)–(iii), limsup = 2n−5). ε-form: M. Waldschmidt, Lecture on the abc conjecture and some of its consequences, Proc. Math. Stat. 98 (2015), 211–230. https://webusers.imj-prg.fr/~michel.waldschmidt/articles/pdf/abcLahoreProceedings.pdf
Read-back

What the Lean code literally says, in plain math · GLM (Z.ai), blind code-only pass — NOT an independent sub-agent

n_conjecture (n : ℕ) (hn : 3 ≤ n) : conjAt n. For every natural number nnn with 3≤n3\le n3≤n, the assertion conjAt n holds. Unfolded: for every real ε>0\varepsilon>0ε>0 there exists a real C>0C>0C>0 (which may depend on nnn and ε\varepsilonε) such that every admissible integer nnn-tuple aaa satisfies

max⁡i∣ai∣ ≤ C⋅rad⁡ ⁣(∏i∣ai∣) 2n−5+ε.\max_{i}|a_i|\ \le\ C\cdot\operatorname{rad}\!\Big(\prod_i|a_i|\Big)^{\,2n-5+\varepsilon}.imax​∣ai​∣ ≤ C⋅rad(i∏​∣ai​∣)2n−5+ε.

Admissible means: ∑iai=0\sum_i a_i=0∑i​ai​=0; the setwise gcd of the ∣ai∣|a_i|∣ai​∣ is 111; and no nonempty proper subsum is 000. The radical rad⁡(m)=∏p∈m.primeFactorsp\operatorname{rad}(m)=\prod_{p\in m.\mathrm{primeFactors}}prad(m)=∏p∈m.primeFactors​p is the product of distinct prime factors; the maximum is Finset.sup of the natural absolute values; the exponent 2n−5+ε2n-5+\varepsilon2n−5+ε is real arithmetic with nnn cast to R\mathbb RR. This is the goal theorem of the mission.

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