We prove that for positive integers n and k and a positive even integer m, the odd integer set {1,3,5 ..... 2n-l} contains k disjoint subsets having a constant sum m if and only if 4k<~m<~n2/k, n2-mk#2 and either m#4n-2 or n#4k.
โฆ LIBER โฆ
Disjoint subsets of integers having a constant sum
โ Scribed by Kiyoshi Ando; Severino Gervacio; Mikio Kano
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 262 KB
- Volume
- 82
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
We prove that for positive integers n, m and k, the set (1, 2, . , n} of integers contains k disjoint subsets having a constant sum m if and only if 2k -1 G m c n(n + 1)/(2k).
๐ SIMILAR VOLUMES
Disjoint odd integer subsets having a co
โ
Hikoe Enomoto; Mikio Kano
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 213 KB
Disjoint odd integer subsets having a co
โ
Hung-Lin Fu; Wei-Hsin Hu
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 418 KB
We prove that for positive k, n and m, the set { 1,3, . ,2n -1) of odd integers contains k disjoint subsets having a constant odd sum m if and only if 9(k-1)Cm <2n-1, or 9k<m<n2/k and n2-mk#2.
A procedure for generating sums of disjo
โ
Brijendra Singh
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 201 KB
The Largest Integer Expressible as a Sum
โ
Hisashi Yokota
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 113 KB
A new algorithm for minimal disjoint sum
โ
Su Chen; Daorong Xu; Shibai Tong
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 277 KB
On Number of Integers Representable as a
โ
Hisashi Yokota
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 262 KB