C(m + n, 2)==>i saw this on a test what does it mean????
C(m + n, 2)==>i saw this on a test what does it mean????
Most likely a function call. What do you find so surprising about it?
I might be wrong.
Quoted more than 1000 times (I hope).Thank you, anon. You sure know how to recognize different types of trees from quite a long way away.
there was no function like that
Maybe it was a macro.
can explain more????
for example C(100,5)=????
Macros - The C Preprocessor
Look at the "function-like macros"
edit: and macro arguments
Look for something like
Code:#define C(x, y) ...
I might be wrong.
Quoted more than 1000 times (I hope).Thank you, anon. You sure know how to recognize different types of trees from quite a long way away.
The Question was :
There are 100 balls which are same and 5 boxes
in the that there will be at least 6 balls in each box.
how many ways there can be??
a)C(100,5)
b)C(70,5)
c)C(70,5)-5!
d)2*C(70,5)
E)C(74,4)
note: it was a computer programming test
Last edited by alperen1994; 04-24-2009 at 08:07 AM.
I was never good at math like this. But I WAS always good at telling the answer given a set of answers.
See, the questions are most often generated like this: take the correct answer. Then change one or two things in the answer for every wrong answer. This is to be "smart": If you don't know one of them, you're not sure. But this can be abused.
For instance, let's say you have a question with historic events A through E. You have to put them in the right order. Four answers could be:
ABCDE
ABCED
ACBDE
EBCDA
Look at the first character: A's most common, so A's probably the first. Same for the rest of the characters. This way you can tell ABCDE is most likely the answer. Not using this way, however, makes it a bit harder: mix two things up, and you get the wrong answer...
Now let's do that on your question. C has two parameters. Most of the times, the first one is 70, so that is probably correct. Identically, the second is probably 5. And most of them don't have any additional things. So B is probably correct, on my method.
Don't use this method unless you have to guess, though...
Based on the context, it's probably the choose(n,k) function, defined as how many ways you can choose n objects from a set of k total. It's calculated as n!/(k!(n-k)!).
As with all things in life, Wikipedia knows best - Binomial coefficient - Wikipedia, the free encyclopedia