The -conjecture (Browkin–Brzeziński)
OpenNConjecture.n_conjectureThe -conjecture of Browkin and Brzeziński (§2, p. 933), the generalization of the abc conjecture to more than three integers. For every and every there exists a constant (depending only on and ) such that every admissible -tuple of integers — satisfying , , and no nonempty proper subsum equal to — obeys
Equivalently, where ranges over all admissible -tuples; the lower bound is their proved Theorem 1, so the content of the goal is the upper bound. The case is the abc conjecture, and every case 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 is real arithmetic.
import Mathlib import Definitions.Def_NConjecture_Defs
namespace NConjecture theorem n_conjecture (n : ℕ) (hn : 3 ≤ n) : conjAt n := by sorry end NConjecture
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 with , the assertion conjAt n holds. Unfolded: for every real there exists a real (which may depend on and ) such that every admissible integer -tuple satisfies
Admissible means: ; the setwise gcd of the is ; and no nonempty proper subsum is . The radical is the product of distinct prime factors; the maximum is Finset.sup of the natural absolute values; the exponent is real arithmetic with cast to . This is the goal theorem of the mission.