Erdős Problem #338 — The restricted order of a basis is the least integer (if it exists) such that every large integer is the sum of at most distinct summands from .
The restricted order of a basis is the least integer (if it exists) such that every large integer is the sum of at most distinct summands from . What are necessary and sufficient conditions that this exists? Can it be bounded (when it exists) in terms of the order of the basis? What are necessary and sufficient conditions that this is equal to the order of the basis?
References
Primary source
Additional references
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.