If I have 10 different objects, how many combinations of them can I make?
The object does not have to be included (So it can be yes or no)
So for example, I can have the first 5 objects, but not the last 5, or just the 1st 3rd and 7th ones.
How could I find the answer to how many combinations I could make?
The object does not have to be included (So it can be yes or no)
So for example, I can have the first 5 objects, but not the last 5, or just the 1st 3rd and 7th ones.
How could I find the answer to how many combinations I could make?
-
I'm assuming that a combination could include none, some, or all of the objects.
Then each of the 10 objects has two possible outcomes: it is either included or not included in the combination.
By the fundamental counting principle, there are 2^10 = 1,024 possible combinations.
Lord bless you today!
Then each of the 10 objects has two possible outcomes: it is either included or not included in the combination.
By the fundamental counting principle, there are 2^10 = 1,024 possible combinations.
Lord bless you today!
-
consider that you can have a set of 1 or 2 or...10.
There is one way to have a set of 1. (or 10)
There are45 ways to have a set o 2 (or 9) . (10x9)/2
120 for three (10x9x80(/(3x2x1)
figure each level than sum results. A set of one has as many choices as a set of nine since they are equivalent events. That is, selecting one to keep, or one to omit. also you have to divide each initial product by the factorial of the number of elements since order does not matter.
add 1 if considering a combination with no elements.
There is one way to have a set of 1. (or 10)
There are45 ways to have a set o 2 (or 9) . (10x9)/2
120 for three (10x9x80(/(3x2x1)
figure each level than sum results. A set of one has as many choices as a set of nine since they are equivalent events. That is, selecting one to keep, or one to omit. also you have to divide each initial product by the factorial of the number of elements since order does not matter.
add 1 if considering a combination with no elements.