# How many combinations of 6 items are possible?

I have 6 items and want to know how many combinations are possible in sets of any amount. (no duplicates)

e.g. It's possible to have any of the following:
1,2,3,4,5,6
1,3,5,6,2
1
1,3,4

there cannot be duplicate combinations:
1,2,3,4
4,3,2,1

Edit: for some reason I cannot add more comments. @miracle173 is correct. Also {1,1} is not acceptable

-
Be aware of the case when the set of numbers contains the numbers 0,1,2,3,4,5 then 012 will be numerically equal to 12. –  Emmad Kareem Feb 29 '12 at 9:40
there are no zeros. it is "six items" –  Mark W Feb 29 '12 at 10:12
Do you want to know the number of all subsets (except the empty one)? If there are 3 items 1,2,3 wich 'combinations' dou you want? The following 7 ? {1} {2} {3} {1,2} {1,3} {2,3}{1,2,3} –  miracle173 Feb 29 '12 at 10:51
To make your question complete, please identify whether the following is acceptable or not {1,1}. –  Emmad Kareem Feb 29 '12 at 11:27
Comments working again: @miracle173 you are correct. –  Mark W Feb 29 '12 at 12:29
show 1 more comment

Your are asking the number of subsets of a set with n elements.{1,2,3,...,n} Each subset can be represented by a binary string, e.g for the set {1,2,3,4,5,6} the string 001101 means the subset that

does not contain the element 1 of the set, because the 1st left character of the string is 0

does not contain the element 2 of the set, because the 2nd left character of the string is 0

does contain the element 3 of the set, because the 3rd left character of the string is 1

does contain the element 4 of the set, because the 4th left character of the string is 1

does not contain the element 5 of the set, because the 5th left character of the string is 0

does contain the element 6 of the set, because the 6th left character of the string is 1

so 001101 means the subset {3,4,6}. Therefore there asre as many subsets as strings of length n. With n binary digits one can count from 0 to 2^n-1, therefore there are 2^n such strings and 2^n subsets of {1,....,n}. 00...0 means the empty subset. if you dont want count the empty subset then you have only 2^n-1 subsets.

-
marked as answer as it provides the clearest novice friendly explaination –  Mark W Feb 29 '12 at 13:54
Interesting approach to the problem.Good thought. –  João Feb 29 '12 at 23:29

$2^6$. Think of it like a garden of forking paths where at the first fork you have to decide whether or not to include 1, then 2, then 3... With each choice the number of possibilities doubles.

-
...though remember that this includes the empty subset –  Henry Feb 29 '12 at 9:35
Also, it is not clear whether the OP wants to count reordered sequences. The use of sets hints at no, but the second example given is (on purpose?) not increasing. –  Ansgar Esztermann Feb 29 '12 at 9:57
the order of items doesnt matter, sorry I should have explained better. (so no re-ordering) –  Mark W Feb 29 '12 at 10:14

My thought was:

Each combination of $k$ elements $n$ by $n$ can be express by $^kC_{n}$.As I understood you want to make sets of $1,2,3,4,5$ and $6$ elements from a sample of $6$ elements without reapeting.So there is a line in pascal's triangle where $k=6$ and $n \in \{ 1,2,3,4,5,6\}$, I'll not include the $0$.

Then we'll get:

$^6C_{1}+^6C_{2}+^6C_{3}+^6C_{4}+^6C_{5}+^6C_{6}=2^6-1$

The minus $1$ is because the $^6C_{0}$ is not inclued. I thing is that.

Explain:

Each combination refers to each set. A set of $1$ element, a set of $2$ elements...and so on.The $^6C_{0}$ it's not valid for this particular problem, because the problem don't allow the empty set. For any line of the Pascal's triangle the sum of all elements of this line is given by $2^n$, where $n$ is the number's line.So if the $^6C_{0}$ is not inclued the solution is given by $2^n-1$, where in this case $n=6$.

-
Could you explain this in a form for someone without a mathematics background please. –  Mark W Feb 29 '12 at 12:28