We have a magical carrot multiplier machine, which multiplies an input carrot into at most 6 carrots, and minimum just 1 (gives the carrot back). But it can multiply only original carrots, the ones which were not put into the machine ever.
There are carrots of different shades such that there are exactly carrots of each shade. All of these carrots after treating with the machine, are filled in a bag.
There are different compositions possible for this bag. Find .
Details and Assumptions :-
The carrots formed by multiplying one particular carrot are identical (due to magic of the multiplier).
The different shades are well distinguishable, no 2 look alike.
This problem is a part of the set Vegetable Combinatorics
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Just look at the possible number of carrots of a particular color in the bag.
The bag will have at least 2 carrots of any given color (If both of them were given back by machine), and maximum 12 carrots of any given color (If both of them were multiplied to 6).
Thus there are 1 1 different contributions possible from a given color for the bag.
We have 143 colors, so by rule of product , there will be 1 1 1 4 3 compositions for the bag. n = 1 4 3