Skip to search boxSkip to navigationSkip to main content

Enumeration Problems for a Linear Congruence Equation

Scholarship:
Journal Article
Article
Research
Peer-review

Abstract

<div class="line" id="line-5"> Let m &ge; 2 and r &ge; 1 be integers and let c &Jukcy; Zm = {0, 1, &hellip;,m &boxh; 1}. In this paper, we give an upper bound and a lower bound for the number of unordered solutions x1, &hellip;, xn &Jukcy; Zm of the congruence x1 + x2 + &bull;&bull;&bull; + xr &equiv; 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 interrelationship with the restricted integer partition.</div>

Scholarship

Output type

Scholarship:
Journal Article
Article
Research
Peer-review

Original language

American English

Journal (Volume, Issue Number)

Taiwanese Journal of Mathematics (Volume 18)

Publication milestones

  • Published - 02/2014

Publication status

Published - 02/2014

Publication IDs

  • Scopus: 84892587061