On an inverse problem in additive number theory

preprint2020arXivOpen access

Abstract

For a set AA, let P(A)P(A) be the set of all finite subset sums of AA. In this paper, for a sequence of integers B={1<b1<b2<⋯ }B=\{1<b_1<b_2<\cdots\} and 3b1+5≤b2≤6b1+103b_1+5\leq b_2\leq 6b_1+10, we determine the critical value for b3b_3 such that there exists an infinite sequence AA of positive integers for which P(A)=N∖BP(A)=\mathbb{N}\setminus B. This result shows that we partially solve the problem of Fang and Fang [`On an inverse problem in additive number theory', Acta Math. Hungar. 158(2019), 36-39].

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.