An elementary proof of Lucas's theorem

MaRDI QIDQ6894337zbMATH OpenFDO

Authors Zübeyir Çınkır

Publication date 25 November 2025

Published in Journal of the Ramanujan Mathematical Society (Search for Journal in Brave)

Full work available at URL http://www.mathjournals.org/jrms/2025-040-004/2025-040-004-004.html

zbMATH Keywords

Lucas theoremVandermonde identity

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Congruences; primitive roots; residue systems (11A07) Primes (11A41)

Review text

Another proof of the 1878 Lucas's theorem is given here by way of a modified Vandermonde identity modulo a prime \(p\): \N\[ \N\binom{m}{k} \equiv \sum_{j=0}^d \binom{d}{j} \binom{m-dp^s}{k-jp^s} \pmod p, \N\]\Nvalid for any suitable values of \(d\), \(s\geq 1\).

Cites work

• A new proof of Lucas' Theorem
• Applications of a Simple Counting Technique
• Binomial Coefficients Modulo a Prime
• Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems
• scientific article; zbMATH DE number 5723744 (Why is no real title available?)
• scientific article; zbMATH DE number 3467565 (Why is no real title available?)
• scientific article; zbMATH DE number 1114507 (Why is no real title available?)
• On some generalizations of Fermat's, Lucas's and Wilson's theorems.
• On the congruences of Euler numbers and the differential coefficients of trigonometric functions with respect to a prime modulus.

This page was built for publication: An elementary proof of Lucas's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894337)