Skip to search boxSkip to navigationSkip to main content

Algorithms for enumeration problem of linear congruence modulo m as sum of restricted partition numbers

*Corresponding author for this work
Scholarship:
Journal Article
Article
Research
Peer-review

Abstract

<p>We consider the congruence x<sub>1</sub> + x<sub>2</sub> +.. + x<sub>r</sub> ≡ c (mod m), where m and r are positive integers and c ∈ ℤ<sub>m</sub>:= {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 x<sub>1</sub> ⩽ x<sub>2</sub> ⩽.. ⩽ x<sub>r</sub>, 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.</p>

Scholarship

Output type

Scholarship:
Journal Article
Article
Research
Peer-review

Original language

English

Pages 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-3452

Publication IDs

  • Scopus: 84916225183