Question

There are m bags, which are numbered by m consecutive positive integers starting with the number k. Each bag contains as many different flowers as the number labeled against the bag. A boy has to pick up k flowers from any one of the bags. The number of different ways he can do the work is:

Options:
a. Aₖᵐ​
b. (m/k​)
c. Pₖᵐ​
d. Cₖᵐ​

Answer 1

The number of different ways the boy can pick up k flowers from any one of the bags is given by the combination formula C(m, k) = m! / (k! * (m-k)!). Therefore, the correct option is d. Cₖᵐ​

Step-by-step explanation:

The number of different ways the boy can pick up k flowers from any one of the bags is given by the combination formula:

C(m, k) = m! / (k! * (m-k)!)

Where:

m is the number of bags,

k is the number of flowers to be picked up from each bag,

C(m, k) represents the number of different ways to select k flowers from m bags.

Therefore, the correct option is d. Cₖᵐ​