It is possible that there are several different ways to count the number of items in a set and we get different expressions for the same count. In such cases, the expressions for the count are equal, as they are counting the same set. Prove the following identity by counting the number of binary strings of length n in two different ways. Xn k=0 n k = 2n
