Erdős Problem #338 — The restricted order of a basis is the least integer tt (if it exists) such that every large integer is the sum of at most tt distinct summands from AA.

About 21 years old · traced to

The restricted order of a basis is the least integer tt (if it exists) such that every large integer is the sum of at most tt distinct summands from AA. 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

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.