Algorithms for enumeration problem of linear congruence modulo m as sum of restricted partition numbers
Tian-Xiao HE , Peter J. -S. SHIUE
Front. Math. China ›› 2015, Vol. 10 ›› Issue (1) : 69 -89.
Algorithms for enumeration problem of linear congruence modulo m as sum of restricted partition numbers
We consider the congruence x 1 + x 2 + + x r ≡ c (mod m), where m and r are positive integers and . 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 , 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.
Congruence / multiset congruence solution / restricted integer partition
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
Higher Education Press and Springer-Verlag Berlin Heidelberg
/
| 〈 |
|
〉 |