Combinatorial identities have a fascinating history inmathematics many of which involve binomial coefficients which arerecursive in nature. Numerous identities are derived fromgenerating functions or proven by recurrence equations. We examine acertain interesting combinatorial identity found in a text ofPolya and Szego, 1924. We show a derivation and proof of thisidentity. We also show a generalization of the identity.