Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/61220Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vites Longani | en_US |
| dc.date.accessioned | 2018-09-10T04:06:56Z | - |
| dc.date.available | 2018-09-10T04:06:56Z | - |
| dc.date.issued | 2007-01-01 | en_US |
| dc.identifier.issn | 09720529 | en_US |
| dc.identifier.other | 2-s2.0-85024564334 | en_US |
| dc.identifier.other | 10.1080/09720529.2007.10698127 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85024564334&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/61220 | - |
| dc.description.abstract | An algorithm for finding all partitions of an integer n as a sum of k positive integers is discussed. The number of the partitions can also be obtained. © 2007 Taylor & Francis Group, LLC. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | An algorithm for partitioning an integer n as a sum of k positive integers | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Journal of Discrete Mathematical Sciences and Cryptography | en_US |
| article.volume | 10 | 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.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.