Let a(n) be the number of representations of the positive integer n as an ordered sum of 1's and 2's. Let b(n) be the number of representations of the positive integer n as an ordered sum of integers greater than 1. Show that a(n)=b(n+2) for each n. PutnamcombinatoricsrepresentationSummation