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 .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call