writer
5,435
edits
Changes
Jump to navigation
Jump to search
Line 6:
Line 6: − + − + − +
→Description
==Description==
==Description==
*This function gives the combination of <math>n</math> objects.
*This function gives the combination of <math>n</math> objects.
*i.e. An arrangement of <math>r</math> objects without any repetition, selected from <math>n</math> different objects is called a combination of <math>n</math> objects taken <math>r</math> at a time.
*i.e An arrangement of <math>r</math> objects without any repetition, selected from <math>n</math> different objects is called a combination of <math>n</math> objects taken <math>r</math> at a time.
*Also if the order is not a matter, it is a Combination.
*If the order is not a matter, it is a Combination.
*If order is a matter it is a Permutation.
*If the order is a matter it is a Permutation.
*A combination is denoted by nCr or <math>\binom{n}{r}</math>.
*A combination is denoted by nCr or <math>\binom{n}{r}</math>.
*A formula for the number of possible combinations of <math>r</math> objects from a set of <math>n</math> objects is <math>\binom{n}{r}=\frac{n!}{r!(n-r)!}</math> where <math>n!=1*2*3*...*n </math> & <math>r \le n</math>.
*A formula for the number of possible combinations of <math>r</math> objects from a set of <math>n</math> objects is <math>\binom{n}{r}=\frac{n!}{r!(n-r)!}</math> where <math>n!=1*2*3*...*n </math> & <math>r \le n</math>.