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

Euler numbers \(E_0,E_1,\dots\) are integers defined by the recursion \(E_0=1,\,(E+1)^n+(E-1)^n=0\) for \(n\geq 1\) (in the customary notation). In particular, \(E_{2n+1}=0\) for \(n\geq 0\). It is known that \(E_k \equiv \sum_{j=0}^{q-1}(-1)^j(2j+1)^k\pmod q\) for \(k\geq 0\), where \(q\) is any odd modulus. The author finds a similar but more complicated congruence for \(E_{2k}\) modulo any 2-power. As a corollary he obtains a new proof for the known result that \(E_{2k}\equiv E_{2l}\!\!\pmod{2^n}\) if and only if \(k\equiv l \!\!\pmod{2^{n-1}}\).