Note on a Binomial Coefficient Divisor

Abstract

Summary Let n be a positive integer, and k and integer with . Let g be the greatest common divisor of k and n. We use the cycle construction to give a combinatorial proof that the fraction n/g divides the binomial coefficient .