A GENERALIZATION OF A SUBSET-SUM-DISTINCT SEQUENCE
![]() ![]() |
Bae, Jae-Gug
(Department of Applied Mathematics Korea Maritime University)
Choi, Sung-Jin (Department of Applied Mathematics Korea Maritime University) |
1 |
An improved lower bound on the greatest elemcnt of a sum-distinct set of fixed order
/
DOI |
2 |
Old and new problems and results in combinatiorial number theory
/
|
3 |
Integer sets with distinct subset-sums
/
|
4 |
On subset-sum-distinct sequences
/
|
5 |
A compactness result for a set of subest-sum-distinct sequences
/
과학기술학회마을 |
6 |
/
|
7 |
Distinct sums over subsets
/
DOI ScienceOn |
8 |
A sum packing problem of Erdos and the Conway-guy sequence
/
DOI ScienceOn |
9 |
On weird and pseudoperfect numbers
/
DOI ScienceOn |
10 |
Problems and results in additive number theory
/
|
11 |
Classification of greedy subset-sum-distinct-sequences
/
|
12 |
An extremal problem for subset-sum-distinct sequences with congruence conditions
/
DOI ScienceOn |
13 |
Solution of a problem of P. Erdos
/
|
14 |
A construction for sets of integers with distinct subset sums
/
|
15 |
Sets of integers whose subsets have distinct sums
/
|
16 |
Number Theory
/
|
![]() |