A Chinese restaurant charges a standard price for its "family dinner" consisting of any four different dishes on the menu. The restaurant's advertisement claims that "over 300 different family dinners are possible". If this is true, what must be the least number of dishes listed on the menu?
any options available?
permutations or combinations?
no idea
but it is in that domain
based on the question i would say combination
you have the answer? so i can check
does a dinner have to include three items, ? can any of there be blank
with all due respect @Omniscience if i give an answer i might get a random solution that gives the answer only by coincidence. So, i'd like to know the right solution so it might be best to keep the answer
i have mis-read the question
eleven ?
how did you get 11?
i know i have to do \[_n C _4 \ge 300\] but how do i solve for n?
well taking combinations \[C^k_4>300\] the smallest value of k that make the combination over 300 is k=11 \[C^{10}_4=210\] \[C^{11}_4=330\]
um i just tried some numbers , not exactly a great method
i dont think there is a inverse for combinations,
hmm makes sense...
so there's no other way to solve for n?
\[^nC_4\geq300\] \[\frac{n!}{4!(n-4)!}\geq300\] \[\frac{n(n-1)(n-2)(n-3)(n-4)!}{(n-4)!}\geq300\times4!\] \[{n(n-1)(n-2)(n-3)}\geq300\times4!\]
Join our real-time social learning platform and learn together with your friends!