This paper determines the value of SX for perfect additive complements, highlighting the uniqueness of sums in the nonnegative integers.
Two sets A, B of nonnegative integers are called additive complements, if all sufficiently large integers can be expressed as the sum of two elements from A and B. We call A, B perfect additive complements if every nonnegative integer can be uniquely expressed as the sum of two elements from A and B. Let $A(x)$ be the counting function of A. In this paper, we focus on the function $SX$, where SX=x→∞max(x),B(x)\√x was introduced by Erd os and Freud in 1984. As a main result, we determine the value of $SX$ for perfect additive complements, and further fix the infimum. We also give the absolute lower bound of $SX$ for additive complements.
No takes yet. Share an insight, caveat, or question.
Fang et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: