A (human) proof of a triple binomial sum supercongruence

2016/06/17 by Tauraso, Roberto
#11A07 #11B65 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1606.05543

Abstract

In the recent article arXiv:1606.03351, Apagodu and Zeilberger 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 and we leave some remarks for the others.

Related

• Two Triple binomial sum supercongruences
• Using the "Freshman's Dream" to Prove Combinatorial Congruences
• On a conjectural supercongruence involving the dual sequence s_n(x)
• Supercongruences involving products of two binomial coefficients modulo p⁴
• The MHS algebra and supercongruences