Jordan D.

asked • 06/16/15

If there are 100 different flavors, how many possible mixtures can be created?

If I have 100 different flavors, how many possible different flavors can be created?

Mark M.

Without any additional restrictions, it cannot be determined.
Report

06/16/15

Casey W.

tutor
Yes it can, the answer is 2^100-1, as shown below!
Report

06/16/15

3 Answers By Expert Tutors

By:

Mark M.

In the combination of flavors the order does not make a difference, e.g., Lemon, Chocolate, Vanilla is the same as Vanilla, Chocolate, Lemon. How does this affect the number of combinations?
Report

06/16/15

Casey W.

tutor
This is why we consider the object called the Power Set...sets don't care about the order of their elements...they are simply collections of objects and the set S={a,b} is the same as the set S_1 = {b,a}
 
The count provided using the power set to figure out that the number of possible mixtures is 2^100-1, has never considered the order the flavors were chosen.
Report

06/16/15

Casey W.

tutor
Yes, if we strictly forbid single flavors (perhaps because they are not technically mixtures or something we created, they were given to us as ingredients) then we should subtract off not just one for the empty mixture (or set) but an additional 100 for each of the single element sets or individual ingredient flavors that were handed to us:
 
so in this interpretation of the problem 2^100-101 is the solution!
Report

06/16/15

Hugh B. answered • 06/16/15

Tutor
4.9 (36)

Experienced Mathematics/Statistics/Biostatistics Tutor

Casey W.

tutor
1.26765E+30 is not an exact answer...you have rounded to the nearest decimal somewhere...which is a problem because we cannot tell if you subtracted off the empty flavor!
 
the answer of 2^100-1 is EXACT, down to the very last flavor.
 
The technique of counting using combinations n Choose c, for n=100 and c ranging from 1 to 100 is what I alluded to as an alternative above.  The fact we have to use is that the rows of Pascal's triangle sum to 2^n, and then subtract off the extra 1 that is omitted from 100choose0, or the empty flavor profile.
Report

06/16/15

Hugh B.

In the power set formulation, the empty set was subtracted off above because it is included in the power sets . Here, the empty set is not a combination, so the same problem does not occur. Of course you are correct that this is not exact. This is not worth much more discussion IMO. If you would like, we can delete all responses but yours - I wrote mine as yours was being posted and would not have written it had I seen yours first.
Report

06/16/15

Casey W.

tutor
Definitely do not delete your post...your method is 100% correct, and VERY valuable to students! Do not delete (why mathenaticians use pen and cross out instead of pencil).
 
My comment was to simply poibt out that an answer expressed in scientific notation is incorporating the idea of rounding to the nearest and is therefor not an exact answer...in probability and combinatorics closed forms of solutions of this type are necessary to do analytics.
 
Perhaps some one should include an explanation or propf of the fact that the rows of Pascal's triangle sum to 2^n, which would lead us to an answer of 2^100-C for this problem (C=1 and 101 both seem to have valid logic behind them!)
 
new problem:
 
prove that SUM_{k=0...n} n Choose k = 2^n.
 
where n Choose k = n!/[k!(n-k)!]
 
perhaps a proof by induction is in order here!
 
Report

06/16/15

Still looking for help? Get the right answer, fast.

Ask a question for free

Get a free answer to a quick problem.
Most questions answered within 4 hours.

OR

Find an Online Tutor Now

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.