postage_stamp_number
def
The postage stamp number n_h(k): the largest n_h(A) over sets A of k + 1 nonnegative integers.
Statement
noncomputable def postage_stamp_number (h k : ℕ) : ℕ
- Defined in
- arXiv:2610.19470 (Positivity and negativity for h-bases for n), Sec. 1 (the classical postage stamp problem, n_h(k)).
- Verified
- 17 Oct 2026
- Axioms
- none listed
- Built on 2
- int_mem_h_fold_sumsetm belongs to the h-fold sumset hA: m is a sum of exactly h, not necessarily distinct, elements of A.
- postage_stamp_basis_rangen_h(A): the largest n such that every integer in [0, n] belongs to hA (A is an h-basis for n).
- Used by 4
- postage_stamp_number_three_eight_eqThe classical postage stamp number with four stamps (one of them 0) and h = 8: n_8(3) = 89, attained by {0, 1, 9, 14}.
- postage_stamp_number_neg_two_eq_of_mod_four_eq_twoIf h ≥ 2 and h ≡ 2 (mod 4), then n♭_h(2) = n_h(2) = (h² + 6h)/4.
- postage_stamp_number_three_eight_lt_negWith four stamps and h = 8, allowing a negative denomination strictly helps: n_8(3) = 89 < 99 ≤ n♭_8(3). (For three stamps the opposite…
- postage_stamp_number_two_eqThe classical postage stamp number for three stamps: n_h(2) = ⌊(h² + 6h + 1)/4⌋ for every h ≥ 1.
Lean source view module on GitHub
/-- `n_h(k)`: the largest `n_h(A)` over `(k+1)`-element sets `A` of nonnegative integers. -/ noncomputable def postage_stamp_number (h k : ℕ) : ℕ := sSup {n | ∃ A : Finset ℤ, A.card = k + 1 ∧ (∀ a ∈ A, 0 ≤ a) ∧ postage_stamp_basis_range h A = n}