A short proof of the Almkvist-Meurman theorem
Abstract
We give a short generating function proof of the Almkvist-Meurman theorem: For integers h and k0, define the numbers Mn(h,k) by kx(ehx-1)/(ekx-1)=Σn=0∞ Mn(h,k) xn/n!. Equivalently, Mn(h,k) = kn(Bn(h/k) - Bn), where Bn(u) is the Bernoulli polynomial. Then Mn(h,k) is an integer. The proof is related to Postnikov's functional equation for the generating function for intransitive trees.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.