Algorithms for enumeration problem of linear congruence modulo m as sum of restricted partition numbers
- ,
- Peter J.S. Shiue(corresponding author)
- ,
- University of Nevada Las Vegas
Scholarship:
Journal Article
Article
Research
Peer-reviewAbstract
We consider the congruence x1 + x2 +.. + xr ≡ c (mod m), where m and r are positive integers and c ∈ ℤm:= {0, 1,..,m−1} (m ⩾ 2). Recently, W. -S. Chou, T. X. He, and Peter J. -S. Shiue considered the enumeration problems of this congruence, namely, the number of solutions with the restriction x1 ⩽ x2 ⩽.. ⩽ xr, and got some properties and a neat formula of the solutions. Due to the lack of a simple computational method for calculating the number of the solution of the congruence, we provide an algebraic and a recursive algorithms for those numbers. The former one can also give a new and simple approach to derive some properties of solution numbers.
Scholarship
Output type
Scholarship:
Journal Article
Article
Research
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 69-89 (21 pages)Journal (Volume, Issue Number)
Frontiers of Mathematics in China (Volume 10, Issue 1)Publication milestones
- Published - 02/2015
Publication status
Published - 02/2015
ISSN
1673-3452Publication IDs
- Scopus: 84916225183
