Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3645
Articles: 2'506'133
Articles rated: 2609

26 April 2024
 
  » » arxiv » 284593

 Article forum



Combinatorial congruences modulo prime powers
Zhi-Wei Sun ; Donald M. Davis ;
Date 4 Aug 2005
Subject Number Theory; Combinatorics MSC-class: 11B65; 05A10; 11A07; 11B68; 11S05 | math.NT math.CO
AbstractLet $p$ be any prime, and let $a$ and $n$ be nonnegative integers. Let $rin Z$ and $f(x)in Z[x]$. We establish the congruence $$p^{deg f}sum_{k=r(mod p^a)}inom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{sum_{i=a}^{infty}[n/{p^i}]})$$ (motivated by a conjecture arising from algebraic topology), and obtain the following vast generalization of Lucas’ theorem: If $a>1$ and $l,s,t$ are nonnegative integers with $s,t
Source arXiv, math.NT/0508087
Services Forum | Review | PDF | Favorites   
 

No message found in this article forum.  You have a question or message about this article? Ask the community and write a message in the forum.
If you want to rate this article, please use the review section..

Subject of your forum message:
Write your forum message below (min 50, max 2000 characters)

2000 characters left.
Please, read carefully your message since you cannot modify it after submitting.

  To add a message in the forum, you need to login or register first. (free): registration page






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica