Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integers with the distinct sums less or equal to k. The paper shows that this bound is tight
0. Abstract. We will consider the set fk j (k; s(k)) = 1g and its complement. Here, s(k) denotes th...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
AbstractThe paper (Discrete Comput. Geom. 25 (2001) 629) of Solymosi and Tóth implicitly raised the ...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
AbstractAn (h, J)-distinct sum set is a set of J integers such that all sums of h elements (repetiti...
A set S of positive integers has distinct subset sums if there are 2 jSj distinct elements of the ...
Abstract. In this paper we prove that there exist infInitelv many disjoint sets of posItIve integers...
Let k ≥ 5 be an integer, and let x ≥ 1 be an arbitrary real number. We derive a bound Oε,k (x2/3k+ε...
Abstract. An amicable pair consists of two distinct numbers N and M each of which is the sum of the ...
In this paper we prove that there exist infInitely many disjoint sets of posItIve integers which the...
Let $sigma(x)$ denote the sum of all divisors of the (positive) integer x. An amicable pair is a pai...
A set S of positive integers has distinct subset sums if the set x∈X x: X ⊂ S � has 2 |S | distinct ...
AbstractLet k⩾5 be an integer, and let x⩾1 be an arbitrary real number. We derive a boundOε,k(x2/3k+...
0. Abstract. We will consider the set fk j (k; s(k)) = 1g and its complement. Here, s(k) denotes th...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
AbstractThe paper (Discrete Comput. Geom. 25 (2001) 629) of Solymosi and Tóth implicitly raised the ...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
Klamkin and Newman proved in 1969 that there are at most (2k-1)/5 disjoint pairs of positive integer...
AbstractAn (h, J)-distinct sum set is a set of J integers such that all sums of h elements (repetiti...
A set S of positive integers has distinct subset sums if there are 2 jSj distinct elements of the ...
Abstract. In this paper we prove that there exist infInitelv many disjoint sets of posItIve integers...
Let k ≥ 5 be an integer, and let x ≥ 1 be an arbitrary real number. We derive a bound Oε,k (x2/3k+ε...
Abstract. An amicable pair consists of two distinct numbers N and M each of which is the sum of the ...
In this paper we prove that there exist infInitely many disjoint sets of posItIve integers which the...
Let $sigma(x)$ denote the sum of all divisors of the (positive) integer x. An amicable pair is a pai...
A set S of positive integers has distinct subset sums if the set x∈X x: X ⊂ S � has 2 |S | distinct ...
AbstractLet k⩾5 be an integer, and let x⩾1 be an arbitrary real number. We derive a boundOε,k(x2/3k+...
0. Abstract. We will consider the set fk j (k; s(k)) = 1g and its complement. Here, s(k) denotes th...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
AbstractThe paper (Discrete Comput. Geom. 25 (2001) 629) of Solymosi and Tóth implicitly raised the ...
DOI
Add to ORKG