2000 character limit reached
Two Triple binomial sum supercongruences
Published 8 Jul 2016 in math.NT | (1607.02483v1)
Abstract: In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end, they propose some supercongruences as conjectures. Here we prove one of them, including a new companion enumerating abelian squares, and we leave some remarks for the others.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.