arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.0073math.NT
收藏

多重调和和与Wolstenholme定理

Multiple harmonic sums and Wolstenholme's theorem

Julian Rosen

摘要:

我们给出了二项式系数${kp-1\choose p-1}$的一族关于多重调和和的同余式,这是调和数的推广。该族中的每个同余(取决于附加参数$n$)涉及$n$多重调和和的线性组合,并且保持$\mod{p^{2n+3}}$。这些同余式中的系数是整数,取决于$n$和$k$,但独立于$p$。更一般地说,我们构建了一个家庭的同余${kp-1\choose p-1} \mod{p^{2n+3}}$,其成员包含一个变量数目的条款,并表明,在这个家庭有一个独特的“优化”的同余涉及最少的条款。特殊情况$k=2$和$n=0$恢复了Wolstenholme定理${2p-1\choose p-1}\equiv 1\mod{p^3}$,对所有素数$p\geq 5$都有效。我们还描述了这些三元组$(n, k, p)$的优化同余模$p$:他们正是那些与$p$除以伯努利数$B_{p-2n-k}$的分子,或$k \equiv 0, 1 \mod p$。

英文摘要:

We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$) involves a linear combination of $n$ multiple harmonic sums, and holds $\mod{p^{2n+3}}$. The coefficients in these congruences are integers depending on $n$ and $k$, but independent of $p$. More generally, we construct a family of congruences for ${kp-1\choose p-1} \mod{p^{2n+3}}$, whose members contain a variable number of terms, and show that in this family there is a unique "optimized" congruence involving the fewest terms. The special case $k=2$ and $n=0$ recovers Wolstenholme's theorem ${2p-1\choose p-1}\equiv 1\mod{p^3}$, valid for all primes $p\geq 5$. We also characterize those triples $(n, k, p)$ for which the optimized congruence holds modulo an extra power of $p$: they are precisely those with either $p$ dividing the numerator of the Bernoulli number $B_{p-2n-k}$, or $k \equiv 0, 1 \mod p$.

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

↑