# Calculating combinations without duplicate values

I have 128 chairs, and 256 people. How many different combinations of the 256 people can be sitting in the 128 chairs? Order doesn't matter, and obviously the same person can't be sitting in more than one chair at a time (no duplicate values in combinations).

Just to clarify, for example, if person 1 is in chair 1 and person 2 is in chair 2 in a given combination, then person 2 being in chair 1 and person 1 being in chair 2 should only count as 1 combination, since they have already been in the same grouping once. I hope that makes sense!

Thanks!

• I do not know precisely what you are after. There are $\binom{256}{128}$ ways to choose who gets the privilege to sit, if all chairs must be occupied. – André Nicolas Jul 7 '15 at 20:30

It appears as if you are asking how many ways are there to choose 128 people out of the original 256? The solution would simply be ${256 \choose 128}$
• Of course: The definition ${n \choose x}$ is defined as $\frac{n!}{(n-x)!(x!)}$ Therefore, for this case, the value would be: $\frac{256!}{(128!)(128!)} = 5768658823449206338089748357862286887740211701975162032608436567264518750790$ – pMarkov Jul 7 '15 at 20:36