On convolutions of Euler numbers

preprint2010arXivOpen access

Abstract

We show that if p is an odd prime then ∑k=0p−1EkEp−1−k=1(modp)\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p) and ∑k=0p−3EkEp−3−k=(−1)(p−1)/22Ep−3(modp),\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p), where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer n and prime number p>2n+1 we have ∑k=0p−1+2nEkEp−1+2n−k=s(n)(modp)\sum_{k=0}^{p-1+2n}E_kE_{p-1+2n-k}=s(n) (mod p) where s(n) is an integer only depending on n.

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.