frobenius_extremal_family
def
For natural numbers n and q, frobenius_extremal_family n q is the set of natural numbers consisting of all multiples i * q for 1 ≤ i ≤ n - 1, together with (n - 2) * q + 1.
Statement
def frobenius_extremal_family (n q : ℕ) : Set ℕ- Defined in
- scout/2610-32219-a-sharp-upper-bound-for-the-frobenius-number.md:454
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 4
- frobenius_extremal_family_not_mem_zeroIf q ≥ 1, then 0 does not belong to
frobenius_extremal_family n q. - frobenius_extremal_family_closure_eqFor n ≥ 2, the additive submonoid closure of
frobenius_extremal_family n qequals the additive submonoid closure of the pair {q, (n - 2)… - frobenius_extremal_family_mem_generatorIf n ≥ 2, then q belongs to the extremal set family
frobenius_extremal_family n q. - frobenius_extremal_family_frobenius_numberFor any integers n ≥ 3 and q ≥ 2, the Frobenius number of the extremal family
frobenius_extremal_family n qis equal to ((n - 2) * q +…
- frobenius_extremal_family_not_mem_zeroIf q ≥ 1, then 0 does not belong to
Read back from the Lean
Given natural numbers n and q, frobenius_extremal_family n q is the set of natural numbers consisting of:
1. all numbers of the form i * q for some natural number i such that 1 ≤ i and i ≤ n - 1, and
2. the element (n - 2) * q + 1.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The extremal family S_{n,q} = {i * q | 1 ≤ i ≤ n - 1} ∪ {(n - 2) * q + 1} for the Frobenius number bound. -/ def frobenius_extremal_family (n q : ℕ) : Set ℕ := {x | ∃ i, 1 ≤ i ∧ i ≤ n - 1 ∧ x = i * q} ∪ {(n - 2) * q + 1}