Is it always possible to prove a divisibility question using combinatorial argument?
By 'divisibilty question', I am referring to the questions like-
Proving that $ \frac{(n^2)!}{(n!)^n}$ is an integer.
So my question is, is it always possible to make a combinatorial argument for any given expression?( if that expression is indeed an integer).