A combinatorial proof of a result from number theory.
We consider the Brocard-Ramanujan type Diophantine equation P(z) = n! + m!, where P is a polynomial with rational coefficients. We show that the ABC Conjecture implies that this equation has only finitely many integer solutions when d ≥ 2 and .