Abstract
Many combinatorial sequences (e.g. the Catalan and the Motzkin numbers) may be expressed as the constant term of , for some Laurent polynomials P(x) and Q(x) in the variable x with integer coefficients. Denoting such a sequence by , we obtain a general formula that determines the congruence class, modulo p, of the indefinite sum , for any prime p, and any positive integer r, as a linear combination of sequences that satisfy linear recurrence (alias difference) equations with constant coefficients. This enables us (or rather, our computers) to automatically discover and prove congruence theorems for such partial sums. Moreover, we show that in many cases, the set of the residues is finite, regardless of the prime p.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.