11 Choose 10

Combination Calculator
Total items (n)
Items chosen (k)

What is 11 choose 10?

Answer

11 choose 10 is
11

Order doesn't matter, no repeats: 11 ways to choose 10 of 11 items.

Choosing 10 of 11 is the same as leaving 1 out: C(11, 10) = C(11, 1).

C(11, 10) = 11! / (10! · 1!)

= C(11, 1)

= 11 / 1

= 11

If order matters (permutations): P(11, 10) = 11 × 10 × 9 × … × 2 = 39,916,800 — each combination in 10! = 3,628,800 orders.

Row 11 of Pascal's triangle
k11 choose k
01
111
255
3165
4330
5462
6462
7330
8165
955
1011
111

Row sum: 211 = 2,048 — all subsets of 11 items.

See Also

Recalculate with different values ↑

n choose 10 for other n

n choose 10Answer
2 choose 100
10 choose 101
11 choose 1011
12 choose 1066
13 choose 10286
14 choose 101,001
15 choose 103,003
16 choose 108,008
17 choose 1019,448
18 choose 1043,758
19 choose 1092,378
20 choose 10184,756
100 choose 1017,310,309,456,440

FAQ

What is 11 choose 10?

11 choose 10 is 11

Why is 11 choose 10 the same as 11 choose 1?

Every way to choose 10 of 11 items leaves exactly 1 behind, so choosing 10 and choosing which one to leave out are the same count: 11 choose 10 = 11 choose 1 = 11. In the formula n! / (k! (n − k)!) the two factorials below just swap places.

How many ways are there if order matters?

P(11, 10) = 39,916,800. Each of the 11 combinations can be put in order in 10! = 3,628,800 ways, so permutations = combinations × k!: P(n, k) = n! / (n − k)!.

See Also