Extensions of Stern's congruence for Euler numbers

preprint2013arXivOpen access

Abstract

For a nonzero integer aa let En(a){E_n^{(a)}} be given by ∑k=0[n/2](n2k)a2kEn−2k(a)=(1−a)n\sum_{k=0}^{[n/2]}\binom n{2k}a^{2k}E_{n-2k}^{(a)}=(1-a)^n (n=0,1,2,...)(n=0,1,2,...), where [x][x] is the greatest integer not exceeding xx. As En(1)=EnE_n^{(1)}=E_n is the Euler number, En(a)E_n^{(a)} can be viewed as a generalization of Euler numbers. Let kk and mm be positive integers, and let bb be a nonnegative integer. In this paper, we determine E2mk+b(a)E_{2^mk+b}^{(a)} modulo 2m+10 2^{m+10} for m≥5m\ge 5. For m≥5m\ge 5 we also establish congruences for Ukφ(5m)+b,  Ekφ(5m)+b,  Skφ(5m)+b(mod5m+5)U_{kφ{(5^m)}+b},\; E_{kφ{(5^m)}+b},\; S_{kφ{(5^m)}+b}\pmod{5^{m+5}} and Skφ(3m)+b(mod3m+5),S_{kφ{(3^m)}+b}\pmod{3^{m+5}}, where U2n=E2n(3/2)U_{2n}=E_{2n}^{(3/2)}, Sn=En(2)S_n=E_n^{(2)} and φ(n)φ(n) is Euler's function.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.