xercise 11.4.1: Building a generating function for selecting subsets from a heterogeneous set. info About (a) Give a generating function denoting the number of ways to select a subset from a set of three identical apples. (b) Give a generating function denoting the number of ways to select a subset from a set of bananas. There are a total of four bananas, but they are bundled into two groups of two. (c) Now pool the apples and bananas. Give the generating function for the number of ways to select a subset from the pooled set. (d) How many ways are there to select three apples or bananas from the pooled set

he will have 300 because he is really broke and 300 is in his imangine

step-by-step explanation: he ehe heh step by the thy

answer: 1722

step-by-step explanation:

given: the mass of saturn=

the mass of mercury=

the number of times the mass of saturn is greater than the mass of mercury

hence, the mass of saturn is 1722 times greater than the mass of mercury.

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for

step-by-step explanation: