Let C(n) be the number of different groups of integers that can be chosen from the integers 1 through n-1 so that integers in each group add up to n (for example, 4=1 + 1 + 1 + 1 = l + l + 2 = 2 + 2...). Write recursive definitions for C(n) under the following variations:
a. You count permutations. For example, 1,2, 1 and 1, 1, 2 are two groups that each add up to 4.
b. You ignore permutations.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.