DISJOINT ODD INTEGER SUBSETS HAVING A CONSTANT ODD SUM

Full metadata record

DC Field	Value	Language
dc.contributor.author	FU, HL	en_US
dc.contributor.author	HU, WH	en_US
dc.date.accessioned	2014-12-08T15:04:02Z	-
dc.date.available	2014-12-08T15:04:02Z	-
dc.date.issued	1994-04-15	en_US
dc.identifier.issn	0012-365X	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2533	-
dc.description.abstract	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) less-than-or-equal-to m less-than-or-equal-to 2n - 1, or 9k less-than-or-equal-to m less-than-or-equal-to n2/k and n2 - mk not-equal 2.	en_US
dc.language.iso	en_US	en_US
dc.title	DISJOINT ODD INTEGER SUBSETS HAVING A CONSTANT ODD SUM	en_US
dc.type	Article	en_US
dc.identifier.journal	DISCRETE MATHEMATICS	en_US
dc.citation.volume	128	en_US
dc.citation.issue	1-3	en_US
dc.citation.spage	143	en_US
dc.citation.epage	150	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:A1994NH81800009	-
dc.citation.woscount	1	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.