On sums involving products of three binomial coefficients

From MaRDI portal
Publication:4649933

DOI10.4064/AA156-2-2zbMATH Open1269.11019arXiv1012.3141OpenAlexW2962884520MaRDI QIDQ4649933FDOQ4649933


Authors: Zhi-Wei Sun Edit this on Wikidata


Publication date: 15 November 2012

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: In this paper we mainly employ the Zeilberger algorithm to study congruences for sums of terms involving products of three binomial coefficients. Let p>3 be a prime. We prove that sum_{k=0}^{p-1}frac{�inom{2k}k^2�inom{2k}{k+d}}{64^k}equiv 0pmod{p^2} for all din0,ldots,p1 with dequiv(p+1)/2pmod2. If pequiv1pmod4 and p=x2+y2 with xequiv1pmod4 and yequiv0pmod2, then we show sum_{k=0}^{p-1}frac{�inom{2k}k^2�inom{2k}{k+1}}{(-8)^k}equiv 2p-2x^2pmod{p^2} mbox{and} sum_{k=0}^{p-1}frac{�inom{2k}k�inom{2k}{k+1}^2}{(-8)^k}equiv-2ppmod{p^2} by means of determining x mod p2 via (-1)^{(p-1)/4},xequivsum_{k=0}^{(p-1)/2}frac{k+1}{8^k}�inom{2k}k^2equivsum_{k=0}^{(p-1)/2}frac{2k+1}{(-16)^k}�inom{2k}k^2pmod{p^2}. We also solve the remaining open cases of Rodriguez-Villegas' conjectural congruences on sum_{k=0}^{p-1}frac{�inom{2k}k^2�inom{3k}k}{108^k}, sum_{k=0}^{p-1}frac{�inom{2k}k^2�inom{4k}{2k}}{256^k}, sum_{k=0}^{p-1}frac{�inom{2k}{k}�inom{3k}k�inom{6k}{3k}}{12^{3k}} modulo p2.


Full work available at URL: https://arxiv.org/abs/1012.3141




Recommendations





Cited In (33)

Uses Software





This page was built for publication: On sums involving products of three binomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649933)