Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/13566| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Treml M. | en |
| dc.date.accessioned | 2020-03-03T14:52:50Z | - |
| dc.date.available | 2020-03-03T14:52:50Z | - |
| dc.date.issued | 1999-03-28 | en |
| dc.identifier.issn | 0012365X | en |
| dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/13566 | - |
| dc.description.abstract | Research problem 231, Discrete Mathematics 140 (1995) says: Let A be a set of 2k, k ≥ 2, distinct positive integers. It is desired to partition A into two subsets A0 and A1 each with cardinality k so that the sum of any k - 1 elements of Ai is not an element of Ai+1, i = 0, 1 mod 2. It is not possible to find such a partition when A is {1,3,4,5,6,7} or any of {1,2,3,4,5,x}, x ≥ 7. Can it be done in all other cases? We show that the answer is affirmative for k ≥ 3 with some exceptions for k = 3. © 1999 Elsevier Science B.V. All rights reserved. | en |
| dc.relation.ispartof | Discrete Mathematics | en |
| dc.title | Some partitions of positive integers | en |
| dc.type | Journal/Magazine Article | en |
| dc.identifier.doi | 10.1016/S0012-365X(98)00307-0 | en |
| dc.identifier.scopus | 2-s2.0-0041706611 | en |
| dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0041706611 | en |
| dc.relation.lastpage | 271 | en |
| dc.relation.firstpage | 267 | en |
| dc.relation.issue | 1-3 | en |
| dc.relation.volume | 199 | en |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| Appears in Collections: | Naučne i umetničke publikacije | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.