Abstract
A set is called if every sufficiently large integer can be written as the sum of distinct elements of . In this paper we present a new method for proving the completeness of a set, improving results of Cassels ('60), Zannier ('92), Burr, Erdős, Graham, and Li ('96), and Hegyvári ('00). We also introduce the somewhat philosophically related notion of a set and refine a theorem of Furstenberg ('67).
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.