The sum ∑k=0q−1(2kk)\sum_{k=0}^{q-1}\binom{2k}{k} for q a power of 3

preprint2010arXivOpen access

Abstract

We prove that ∑k=0q−1(2kk)≡q2(mod3q2)\sum_{k=0}^{q-1}\binom{2k}{k}\equiv q^2\pmod{3q^2} if q>1 is a power of 3, as recently conjectured by Z.W. Sun and R. Tauraso. Our more precise result actually implies that the value of (1/q2)∑k=0q−1(2kk)(1/q^2)\sum_{k=0}^{q-1}\binom{2k}{k} modulo a fixed arbitrary power of 3 is independent of q, for q a power of 3 large enough, and shows how such value can be efficiently computed.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.