Most combinatorial identities have fun combinatorial proofs. For example, if c (n, k) is the number of ways to choose k elements from a set of n elements, prove that 2 n = c (n, 0) + c (n, 1) + … + c (n, n).
FBI Reform - fbireform.comFBI Reform - fbireform.com - The News And Times