On congruences of Euler numbers modulo powers of two (Q2378229): Difference between revisions

The author establishes some identities involving the Euler numbers, the Euler numbers of order 2 and the central factorial numbers, and gives a new proof of a classical result due to \textit{M. A. Stern} [J. Reine Angew. Math. 79, 67--98 (1874; JFM 06.0103.01)]. Stern gave a brief sketch of the following congruence \[ E_{2n}\equiv E_{2m}\pmod{2^k}\quad\text{if and only if}\quad 2n\equiv 2m\pmod{2^k}.\tag{1} \] Then \textit{F. G. Frobenius} [Sitzungsber. Königl. Preuss. Akad. Wiss. Berlin, 809--847 (1910), also in: Ges. Abh. III, 440--478 (1968; Zbl 0169.28901)] amplified Stern's sketch, and later \textit{R. Ernvall} [Ann. Univ. Turku., Ser. A I 178, 72 p. (1979; Zbl 0403.12010)] gave a proof of (1) using umbral calculus. In 2000 \textit{S. S. Wagstaff} jun. [Number theory for the millennium III. Proceedings of the millennial conference on number theory, Urbana-Champaign, IL, USA, 2000. Natick, MA: A K Peters, 357--374 (2002; Zbl 1050.11021)] used an induction proof, and in 2005 \textit{Z.-W. Sun} [J. Number Theory 115, No. 2, 371--380 (2005; Zbl 1090.11016)] obtained an explicit congruence for Euler numbers modulo powers of two to give a new proof of (1).