Fleck quotients and Bernoulli numbers

Details Fleck quotients and Bernoulli numbers Fleck quotients and Bernoulli numbers

2006-08-14

arxiv.org/abs/math/0608328v1

Mathematics

Number Theory

38 pages

Scientific paper

Let p be a prime, and let n>0 and r be integers. In 1913 Fleck showed that $$F_p(n,r)=(-p)^{-[(n-1)/(p-1)]}\sum_{k=r(mod p)}\binom{n}{k}(-1)^k\in\Z.$$ Nowadays this result plays important roles in many aspects. Recently Sun and Wan investigated $F_p(n,r)$ mod p in [SW2]. In this paper, using p-adic methods we determine $(F_p(m,r)-F_p(n,r))/(m-n)$ modulo p in terms of Bernoulli numbers, where m>0 is an integer with $m\not=n$ and $m=n (mod p(p-1))$. Consequently, $F_p(n,r)$ mod $p^{ord_p(n)+1}$ is determined; for example, if $n=n_*(mod p-1)$ with $00$ and $l\ge 0$ are integers with $2\le n-l\le p$ then $$\frac{1}{p^{n-l}}\sum_{l

Affiliated with

Also associated with

No associations

Rating

Fleck quotients and Bernoulli 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 Fleck quotients and Bernoulli numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fleck quotients and Bernoulli numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242983