Erdős problem 326
Does there exist which is a minimal basis of order (every large integer is the sum of elements from , and no proper subset of has this property) such that for some ? A claimed construction gives a minimal basis with , answering the question affirmatively; Erdős and Graham had conjectured a negative answer.
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/326.leanTrue ↔ ∀ (A : Set ℕ), A.IsAddBasisOfOrder 2 → ∃ b, StrictMono b ∧ ∀ (n : ℕ), b n ∈ A ∧ (Set.range b).IsAddBasis ∧ ∀ (x : ℝ), ¬Filter.Tendsto (fun n => ↑(b n) / ↑n ^ 2) Filter.atTop (nhds x)OpenStatement only, no proof
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
AI collaborating with humans
- Machine
- People
construction
- Machine
- People
- Reported outcome