Applications of Polya’s theorem to distribution problems and partitions of integers

Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/59749

Full metadata record

DC Field	Value	Language
dc.contributor.author	Vites Longani	en_US
dc.date.accessioned	2018-09-10T03:20:54Z	-
dc.date.available	2018-09-10T03:20:54Z	-
dc.date.issued	2009-01-01	en_US
dc.identifier.issn	09720529	en_US
dc.identifier.other	2-s2.0-85024531130	en_US
dc.identifier.other	10.1080/09720529.2009.10698218	en_US
dc.identifier.uri	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85024531130&origin=inward	en_US
dc.identifier.uri	http://cmuir.cmu.ac.th/jspui/handle/6653943832/59749	-
dc.description.abstract	The number of ways to distribute r identical objects into n identical boxes can usually be obtained by a method of generating function or by a recursive formula. In this paper, for another approach, it is shown that we can obtain this number by using generalization of Polya’s theorem. From this, we can also find the number of partitions of integer n as a sum of k positive integers. Computing for the results is discussed. © 2009 Taylor & Francis Group, LLC.	en_US
dc.subject	Mathematics	en_US
dc.title	Applications of Polya’s theorem to distribution problems and partitions of integers	en_US
dc.type	Journal	en_US
article.title.sourcetitle	Journal of Discrete Mathematical Sciences and Cryptography	en_US
article.volume	12	en_US
article.stream.affiliations	Chiang Mai University	en_US
Appears in Collections:	CMUL: Journal Articles

Files in This Item:

There are no files associated with this item.