Skip to main content

Questions tagged [combinatorial-proofs]

Combinatorial proofs include, for example, proofs using double counting or bijective proofs.

Filter by
Sorted by
Tagged with
12 votes
5 answers
835 views

A divisibility of q-binomial coefficients combinatorially

Let a and b be coprime positive integers. Then the number a+b divides the binomial coefficient ${a+b \choose a}$. I know how to prove this combinatorially - for example after choosing an ordered set ...
Peter McNamara's user avatar