A Note on the Congruence (mdnd) ≡ (mn) (modq).

The article offers an annotation to the mathematical congruence (mdnd) ≡ (mn) (modq). Mathematical problems that involve binomial coefficients modulo a prime power have been the focus of many great mathematicians of the 19th century. These mathematicians have derived different theorems that could be easily proved. One of these theorems is the congruence (mdnd) ≡ (mn) (modq). The author presented a partial converse theorem based on this established equation and observed that the same products of binomial coefficients are established on the right of Lucas's theorem.