On the Almkvist-Meurman theorem for Bernoulli polynomials
Abstract
Almkvist and Meurman showed that if h and k are integers, then so is kn(Bn(h/k) - Bn) where Bn(u) is the Bernoulli polynomial. We give here a new and simpler proof of the Almkvist-Meurman theorem using generating functions. We describe some properties of these numbers and prove a common generalization of the Almkvist-Meurman theorem and a result of Gy on Bernoulli-Stirling numbers. We then give a simple generating function proof of an analogue of the Almkvist-Meurman theorem for Euler polynomials, due to Fox.
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.