Question 631248
<font face="Times New Roman" size="+2">


The number of combinations of 31 things take 3 at a time:


*[tex \LARGE \ \ \ \ \ \ \ \ \ \ {{n}\choose{k}}] is the number of combinations of *[tex \Large n] things taken *[tex \Large k] at a time and is calculated by *[tex \Large \frac{n!}{k!(n\,-\,k)!}]


Plug in the numbers and do the arithmetic.


Note:  This only works because of the requirement that the flavors be different.  If duplication of flavors were allowed, then the considerably larger number of possibilities would be calculated by *[tex \LARGE 31^3]


John
*[tex \LARGE e^{i\pi}\ +\ 1\ =\ 0]
My calculator said it, I believe it, that settles it
<div style="text-align:center"><a href="http://outcampaign.org/" target="_blank"><img src="http://cdn.cloudfiles.mosso.com/c116811/scarlet_A.png" border="0" alt="The Out Campaign: Scarlet Letter of Atheism" width="143" height="122" /></a></div>
</font>