A note on the congruence np^k mp^k n m p^r.

DOI10.1007/S10587-012-0016-7MaRDI QIDQ2897344zbMATH OpenOpenAlexFDO

Authors Romeo Meštrović

Publication date 10 July 2012

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/246182

zbMATH Keywords

congruenceLucas' theoremprime powersset \(W(k,r)\)Wolstenholme prime

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Binomial coefficients; factorials; (q)-identities (11B65)

Recommendations

• Some binomial coefficient congruences
• A note on the congruences with sums of powers of binomial coefficients
• A binomial coefficient congruence modulo prime powers
• Congruences involving \({2k\choose k}^2{3k\choose k}\)
• On the sum \(\sum_{k\equiv r\pmod m}{n\choose k}\) and related congruences.

Cites work

• A note on the congruence \({nd \choose md}\equiv{n \choose m}\pmod q\)
• A search for Fibonacci-Wieferich and Wolstenholme primes
• Bernoulli numbers, Wolstenholme's theorem, and \(p^5\) variations of Lucas' theorem
• Combinatorial congruences modulo prime powers
• scientific article; zbMATH DE number 1114507 (Why is no real title available?)
• scientific article; zbMATH DE number 3075873 (Why is no real title available?)
• On the converse of Wolstenholme's Theorem

Cited in

(2)

• Binomial coefficients, roots of unity and powers of prime numbers
• Euclid's proof of the infinitude of primes: distorted, clarified, made obsolete, and confirmed in modern mathematics

This page was built for publication: A note on the congruence \({np^k\choose mp^k} \equiv {n\choose m} \pmod {p^r}\).

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