About a question of Kannappan and Zhang (Q1781913): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Giuseppe Molteni / rank
Normal rank
 
Property / author
 
Property / author: Giuseppe Molteni / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A binomial coefficient congruence modulo prime powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binomial Coefficients Modulo a Prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some congruences for binomial coefficients. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4541493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding sum of powers on arithmetic progressions with application of Cauchy's equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569569 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf03323018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047156578 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:24, 30 July 2024

scientific article
Language Label Description Also known as
English
About a question of Kannappan and Zhang
scientific article

    Statements

    About a question of Kannappan and Zhang (English)
    0 references
    9 June 2005
    0 references
    The author answers a question posed by \textit{Pl. Kannappan} and \textit{W. Zhang} [Result. Math. 42, No. 3--4, 277--288 (2002; Zbl 1053.11014)] about the divisibility of binomial coefficients by a given prime \(p\). From the old result of \textit{E. Lucas} [Bull. Soc. Math. Fr. 6, 49--54 (1878; JFM 10.0139.04)] \(\binom{up+a}{vp+b}\equiv\binom{u}{v}\binom{a}{b}\pmod p\) the author deduces that \(\binom{k}{i}\not\equiv0\pmod p\) for every \(i=1,2,\dots,k\) if and only if \(k=p^r-1\) for some integer \(r>0\).
    0 references
    0 references
    Binomial coefficient
    0 references
    modulo prime
    0 references
    0 references

    Identifiers