Congruences for higher-order Euler numbers. (Q863739): Difference between revisions

The author obtains congruences for higher-order Euler numbers, which are generalizations of those for the ordinary Euler numbers. The Euler number \(E^{(k)}_{2n}\) of order \(k\) is defined by \[ \Biggl({2\over e^x+ e^{-x}}\Biggr)^k= \sum^\infty_{n=0} E^{(k)}_{2n} {x^{2n}\over (2n)!}, \] and the author proves the following Theorem 1. For integers \(n\geq 0\) and \(r\geq 3\) and an odd prime \(p\), if \(r\equiv 2k+ 1\pmod p\) with \(1\leq k\leq (p-1)/2\), then \[ \sum^{(p-1)/2}_{i= 1} E^{(r)}_{2n+ 2i}\equiv 0\pmod p. \] Theorem 2. For integers \(n\geq 0\) and \(r\geq 2\) and an odd prime \(p\), if \(r\equiv 2k+ 2\pmod p\) with \(0\leq k\leq(p-1)/2\), then \[ \sum^{(p-1)/2}_{i=1} E^{(r)}_{2n+ 2i}\equiv {(-1)^{(p+1)/2}\over 2^{2k}} \begin{pmatrix} 2k\\ k\end{pmatrix}\pmod p. \] As a corollary to Theorem 2, he obtains the following congruence \[ \sum^{(p-1)/2}_{i=1} E^{(2)}_{2n+ 2i}\equiv(-1)^{(p+1)/2}\pmod p \] for \(n\geq 0\) and an odd prime \(p\).