Let $ A $ be a sequence of nonnegative integers. A sequence $ A $ is said to be complete if
every sufficiently large integer can be represented as a finite sum of distinct terms of $ A …

Text A set A of positive integers is called d-complete if every sufficiently large integer is the
sum of distinct terms taken from A such that no one divides the other. In this paper we …

In 1996, Erdős and Lewin introduced the notion of $ d $-complete sequences. A sequence
$\mathcal T $ of positive integers is called $ d $-complete if every sufficiently large integer …

For a set A of positive integers, let P (A) denote the set of all finite subset sums of A. In this
paper, we completely solve a problem of Chen and Wu by proving that if B={b 1< b 2<⋯} is a …

For a sequence A⊆ ℕ, let P (A) be the set of all sums of distinct terms taken from A. The
sequence A is said to be complete if P (A) contains all sufficiently large integers. Let p> 1 be …

Text A set A of nonnegative integers is said to be complete if every sufficiently large natural
number is the sum of distinct terms taken from A. In 1959, Birch confirmed a conjecture of …

TEXT: For a sequence A of nonnegative integers, let P (A) be the set of all integers which
can be represented as the finite sum of distinct terms of A and for the empty sum will be 0. A …

A sequence T of positive integers is called d-complete modulo l if for every integer 0≤ u≤ l−
1, there exists an integer v with vl+ u &gt; 0 such that vl+ u can be represented as the sum of …

On Three Problems of Y.–G. Chen | Periodica Mathematica Hungarica Skip to main content
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

The original knapsack problem is well known to be NP-complete. In a multidimensional
version, one have to decide whether ap∈ ℕ k is in the sumset-sum of a set X⊆ ℕ k. In this …