On convolutions of Euler numbers

Details On convolutions of Euler numbers On convolutions of Euler numbers

2010-12-21

arxiv.org/abs/1012.4774v1

Mathematics

Number Theory

6 pages

Scientific paper

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\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 $$\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.

Affiliated with

Also associated with

No associations

Rating

On convolutions of Euler numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On convolutions of Euler numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On convolutions of Euler numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96783