English

On Fleck quotients

Number Theory 2015-06-26 v3 Combinatorics

Abstract

Let pp be a prime, and let n>0n>0 and rr be integers. In this paper we study Fleck's quotient Fp(n,r)=(p)(n1)/(p1)k=r(modp)(nk)(1)kZ.F_p(n,r)=(-p)^{-\lfloor(n-1)/(p-1)\rfloor} \sum_{k=r(mod p)}\binom {n}{k}(-1)^k\in Z. We determine Fp(n,r)F_p(n,r) mod pp completely by certain number-theoretic and combinatorial methods; consequently, if 2np2\le n\le p then k=1n(1)pk1(pn1pk1)(n1)!Bpnpn(modpn+1),\sum_{k=1}^n(-1)^{pk-1}\binom{pn-1}{pk-1} \equiv(n-1)!B_{p-n}p^n (mod p^{n+1}), where B0,B1,...B_0,B_1,... are Bernoulli numbers. We also establish the Kummer-type congruence Fp(n+pa(p1),r)Fp(n,r)(modpa)F_p(n+p^a(p-1),r)\equiv F_p(n,r) (mod p^a) for a=1,2,3,...a=1,2,3,..., and reveal some connections between Fleck's quotients and class numbers of the quadratic fields \Q(±p)\Q(\sqrt{\pm p}) and the pp-th cyclotomic field \Q(ζp)\Q(\zeta_p). In addition, generalized Fleck quotients are also studied in this paper.

Keywords

Cite

@article{arxiv.math/0603462,
  title  = {On Fleck quotients},
  author = {Zhi-Wei Sun and Daqing Wan},
  journal= {arXiv preprint arXiv:math/0603462},
  year   = {2015}
}

Comments

28 pages