Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 82 tok/s
Gemini 2.5 Pro 62 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 36 tok/s Pro
GPT-4o 78 tok/s Pro
Kimi K2 195 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Multiple harmonic sums and Wolstenholme's theorem (1302.0073v1)

Published 1 Feb 2013 in math.NT

Abstract: 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{p3}$, 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$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube