Czechoslovak Mathematical Journal

, Volume 62, Issue 1, pp 59–65 | Cite as

A note on the congruence \(\left( {_{mp^k }^{np^k } } \right) \equiv \left( {_m^n } \right)\) (mod p r )

  • Romeo Meštrović


In the paper we discuss the following type congruences:
$$\left( {_{mp^k }^{np^k } } \right) \equiv \left( {_m^n } \right)(\bmod p^r ),$$
where p is a prime, n, m, k and r are various positive integers with nm ⩾ 1, k ⩾ 1 and r ⩾ 1. Given positive integers k and r, denote by W(k, r) the set of all primes p such that the above congruence holds for every pair of integers nm ⩾ 1. Using Ljunggren’s and Jacobsthal’s type congruences, we establish several characterizations of sets W(k, r) and inclusion relations between them for various values k and r. In particular, we prove that W(k + i, r) = W(k − 1, r) for all k ⩾ 2, i ⩾ 0 and 3 ⩽ r ⩽ 3k, and W(k, r) = W(1, r) for all 3 ⩽ r ⩽ 6 and k ⩾ 2. We also noticed that some of these properties may be used for computational purposes related to congruences given above.


congruence prime powers Lucas’ theorem Wolstenholme prime set W(k, r

MSC 2012

11B65 11A07 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    V. Brun, J. O. Stubban, J. E. Fjelstad, R. Tambs Lyche, K. E. Aubert, W. Ljunggren, E. Jacobsthal: On the divisibility of the difference between two binomial coefficients. 11. Skand. Mat.-Kongr., Trondheim 1949 (1952), 42–54.Google Scholar
  2. [2]
    J. W. L. Glaisher: On the residues of the sums of the inverse powers of numbers in arithmetical progression. Quart. J. 32 (1900), 271–288.zbMATHGoogle Scholar
  3. [3]
    A. Granville: Arithmetic properties of binomial coefficients. I. Binomial coefficients modulo prime powers. Organic mathematics. Proceedings of the workshop, Simon Fraser University, Burnaby, Canada, December 12–14, 1995. Providence, RI: American Mathematical Society. CMS Conf. Proc. 20 (1997), 253–276 (J. Borwein et al., ed.).Google Scholar
  4. [4]
    G. S. Kazandzidis: Congruences on the binomial coefficients. Bull. Soc. Math. Grèce, N. Ser. 9 (1968), 1–12.MathSciNetzbMATHGoogle Scholar
  5. [5]
    E. Lucas: Sur les congruences des nombres eulériens et les coefficients différentiels des functions trigonométriques suivant un module premier. Bull. S. M. F. 6 (1878), 49–54. (In French.)MathSciNetGoogle Scholar
  6. [6]
    R. J. McIntosh: On the converse of Wolstenholme’s Theorem. Acta Arith. 71 (1995), 381–389.MathSciNetzbMATHGoogle Scholar
  7. [7]
    R. J. McIntosh, E. L. Roettger: A search for Fibonacci-Wieferich and Wolstenholme primes. Math. Comput. 76 (2007), 2087–2094.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    R. Meštrović: A note on the congruence \(\left( {_{md}^{nd} } \right) \equiv \left( {_m^n } \right)(\bmod q)\). Am. Math. Mon. 116 (2009), 75–77.zbMATHCrossRefGoogle Scholar
  9. [9]
    Z.-W. Sun, D. M. Davis: Combinatorial congruences modulo prime powers. Trans. Am. Math. Soc. 359 (2007), 5525–5553.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [10]
    J. Zhao: Bernoulli numbers, Wolstenholme’s theorem, and p 5 variations of Lucas’ theorem. J. Number Theory 123 (2007), 18–26.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Institute of Mathematics of the Academy of Sciences of the Czech Republic, Praha, Czech Republic 2012

Authors and Affiliations

  1. 1.Department of Mathematics, Maritime FacultyUniversity of MontenegroKotorMontenegro

Personalised recommendations