Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/75869
DC Field | Value | Language |
---|---|---|
dc.contributor | 應數系 | - |
dc.creator | Chou, Wun-Seng | - |
dc.creator | 周文賢 | zh_TW |
dc.creator | He, T.-X. | en_US |
dc.creator | Shiue, P.J.-S | en_US |
dc.date | 2014 | - |
dc.date.accessioned | 2015-06-16T09:35:17Z | - |
dc.date.available | 2015-06-16T09:35:17Z | - |
dc.date.issued | 2015-06-16T09:35:17Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/75869 | - |
dc.description.abstract | Let m > 2 and r > 1 be integers and let c e Zm = {0,1,..., m - 1}. In this paper, we give an upper bound and a lower bound for the number of unordered solutions x1,..., xn e Zm of the congruence x1 + x2 +...+ xr = c mod m. Exact formulae are also given when m or r is prime. This solution number involves the Catalan number or generalized Catalan number in some special cases. Moreover, the enumeration problem has relationship with the restricted integer partition. | - |
dc.format.extent | 176 bytes | - |
dc.format.mimetype | text/html | - |
dc.relation | Taiwanese Journal of Mathematics, 18(1), 265-275 | - |
dc.subject | Catalan number; Congruence; Generalized catalan number; Iinteger partition | - |
dc.title | Enumeration problems for a linear congruence equation | - |
dc.type | article | en |
dc.identifier.doi | 10.11650/tjm.18.2014.2295 | - |
dc.doi.uri | http://dx.doi.org/10.11650/tjm.18.2014.2295 | - |
item.fulltext | With Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | restricted | - |
item.openairetype | article | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
index.html | 176 B | HTML2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.