Extensions of Wilson's lemma and the Ax-Katz theorem

Details Extensions of Wilson's lemma and the Ax-Katz theorem Extensions of Wilson's lemma and the Ax-Katz theorem

2006-08-23

arxiv.org/abs/math/0608560v1

Mathematics

Number Theory

9 pages

Scientific paper

A classical result of A. Fleck states that if p is a prime, and n>0 and r are integers, then $$\sum_{k=r(mod p)}\binom {n}{k}(-1)^k=0 (mod p^{[(n-1)/(p-1)]}).$$ Recently R. M. Wilson used Fleck's congruence and Weisman's extension to present a useful lemma on polynomials modulo prime powers, and applied this lemma to reprove the Ax-Katz theorem on solutions of congruences modulo p and deduce various results on codewords in p-ary linear codes with weights. In light of the recent generalizations of Fleck's congruence given by D. Wan, and D. M. Davis and Z. W. Sun, we obtain new extensions of Wilson's lemma and the Ax-Katz theorem.

Affiliated with

Also associated with

No associations

Rating

Extensions of Wilson's lemma and the Ax-Katz theorem 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 Extensions of Wilson's lemma and the Ax-Katz theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extensions of Wilson's lemma and the Ax-Katz theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-110104