arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1001.2156math.NT
收藏

q为3的幂的和$\sum_{k=0}^{q-1}\binom{2k}{k}$

The sum $\sum_{k=0}^{q-1}\binom{2k}{k}$ for q a power of 3

Sandro Mattarei

摘要:

我们证明了$\sum_{k=0}^{q-1}\binom{2k}{k}\equiv q^2\pmod{3q^2}$当q>1时是3的幂,正如最近Z.W. Sun和R.陶拉索我们更精确的结果实际上意味着,$(1/q^2)\sum_{k=0}^{q-1}\binom{2k}{k}$模3的固定任意幂的值与q无关,对于q,3的幂足够大,并且显示了如何有效地计算这样的值。

英文摘要:

We prove that $\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/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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑