Congruences for central binomial sums and finite polylogarithms
Congruences for central binomial sums and finite polylogarithms
复制标题
DOI：
10.1016/j.jnt.2012.05.036
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
Sandro Mattarei;R. Tauraso
中科院分区：
文献类型：
--
作者：
Sandro Mattarei;R. Tauraso
TEXT: We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients (2kk), partly motivated by analogies with the well-known power series for (arcsinz)2and (arcsinz)4. The right-hand sides of those congruences involve values of the finite polylogarithms £d(x)=∑k=1p−1xk/kd. Exploiting the available functional equations for the latter we compute those values, modulo the required powers of p, in terms of familiar quantities such as Fermat quotients and Bernoulli numbers. VIDEO: For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=W54Ad0YFr8A.
