There are multiple ways to go about doing this problem.
So you have 5 items and you can choose 2 of them. Also remember that the order of the combinations do not matter (a,b is the same as b,a).
Method 1:
The way that most people would do this problem is by writing out every possible combination.
For this problem, say you have 5 letters (A, B, C, D, and E), and you want to know how many combinations you can make with 2 at a time (can't choose the same letter twice). In this method, try to make sure that your combinations are organized well. Let's write the combinations out.
With 'A' first
A B
A C
A D
A E
With 'B' first
B A (already used this one)
B C
B D
B E
With 'C' first
C A (already used)
C B (already used)
C D
C E
With 'D' first
D A (already used)
D B (already used)
D C (already used)
D E
If you count up the number of combinations that are not crossed out, you get 10 as your final answer.
Method 2:
However, in my opinion, there is a faster way to do this problem: by using the formula for combinations.
Combinations are usually notated as:
nCr
This is read as: "n choose r"
n is the number of items you have, and r is the number you are choosing, and the capital 'c' shows that you have combinations.
In your case, you have 5 items and you are choosing 2 of them at a time, so you have 5C2.
Now, on to the formula:
nCr = n!/((r!)(n-r)!)
This might seem a little strange to you, especially the exclamation points.
These exclamation points represent something called a factorial.
A factorial of a nonnegative number, n, is the product of all the positive integers less than or equal to n.
So,
1! = 1
2! = 2*1 = 2
3! = 3*2*1 = 6
4! = 4*3*2*1 = 24
...and so on.
Now that you understand factorials, let's plug in the numbers for the formula and solve.
nCr = n!/((r!)(n-r)!)
5C2 = 5!/((2!)(5-2)!)
= 5!/((2!)3!)
=(5*4*3*2*1)/(2*1*3*2*1)
= (5*4)(3*2*1)/(3*2*1)(2*1)
= (5*4)(3*2*1)/(3*2*1)(2*1)
= (5*4)/(2*1)
= 20 / 2
5C2 =10
This method may have seemed slow and tedious, but with enough practice, it will be much faster than the other method. Besides, the other method only works well with small numbers. (For big numbers always use this method, if possible).
There are 2*2*5 = 20 combinations.
There are 5C3 = 5*4/(2*1) = 10 combinations
There are 56C5 = 56*55*54*53*51/(5*4*3*2*1) = 3,819,816 combinations.
Assuming the digits cannot be repeated, there are 7 combinations with 1 digit, 21 combinations with 2 digits, 35 combinations with 3 digits, 35 combinations with 4 digits, 21 combinations with 5 digits, 7 combinations with 6 digits and 1 combinations with 7 digits. That makes a total of 2^7 - 1 = 127: too many for me to list. If digits can be repeated, there are infinitely many combinations.
There are 120 permutations and 5 combinations.
You can make 5 combinations of 1 number, 10 combinations of 2 numbers, 10 combinations of 3 numbers, 5 combinations of 4 numbers, and 1 combinations of 5 number. 31 in all.
There are 2*2*5 = 20 combinations.
The rearrangement of 5 figure numbers will be 5x4x3x2x1 which is 120 combinations, when you don't repeat a number.
There are 5C3 = 5*4/(2*1) = 10 combinations
There are 56C5 = 56*55*54*53*51/(5*4*3*2*1) = 3,819,816 combinations.
Assuming the digits cannot be repeated, there are 7 combinations with 1 digit, 21 combinations with 2 digits, 35 combinations with 3 digits, 35 combinations with 4 digits, 21 combinations with 5 digits, 7 combinations with 6 digits and 1 combinations with 7 digits. That makes a total of 2^7 - 1 = 127: too many for me to list. If digits can be repeated, there are infinitely many combinations.
There are 43 combinations of various quantities of quarters (0, 1 or 2), dimes (0 to 5), nickels (0 to 10) and pennies (2 to 52) that make 52 cents.
(3 x 2 x 5) = 30 combinations
7C3 = 7*6*5/(3*2*1) = 35 combinations.7C3 = 7*6*5/(3*2*1) = 35 combinations.7C3 = 7*6*5/(3*2*1) = 35 combinations.7C3 = 7*6*5/(3*2*1) = 35 combinations.
There are 120 permutations and 5 combinations.
Each of the 5 digits has two possibilities. So the total number of possible combinations is2 x 2 x 2 x 2 x 2 = 32 .(Another way to ask the same question is: How many binary numbers can you write with 5 bits ?)
5*4*3*2*1 = 120 combinations. * * * * * No. The previous answerer has confused permutations and combinations. There are only 25 = 32 combinations including the null combinations. There is 1 combination of all 5 numbers There are 5 combinations of 4 numbers out of 5 There are 10 combinations of 3 numbers out of 5 There are 10 combinations of 2 numbers out of 5 There are 5 combinations of 1 numbers out of 5 There is 1 combination of no 5 numbers 32 in all, or 31 if you want to disallow the null combination.