Feedback form
Hi! What do you think?

Drag it here or paste with Ctrl+V


    You can also email us on infocalculat.io

    Combination Calculator

    How many ways to choose k of n items when order doesn’t matter, with the formula worked out

    Combination Calculator

    Total items (n)
    Items chosen (k)

    How to Count Combinations: n Choose k

    C(n, k) = n! / (k! (n − k)!): multiply k numbers counting down from n, then divide by k!.

    Example: 4 choose 2

    C(4, 2) = 4! / (2! · 2!)

    = (4 × 3) / (2 × 1)
    = 12 / 2

    = 6

    Common mistakes

    • k larger than n gives 0, not an error: 1 choose 3 = 0, because you can't choose 3 different items from 1. Usually the numbers were swapped — 3 choose 1 = 3.
    • 0! = 1, so choosing none and choosing all are one way each: 5 choose 0 = 5 choose 5 = 1.
    • If order matters, count permutations P(n, k) = n! / (n − k)! instead: 4 choose 2 = 6, but P(4, 2) = 12 — each pair counted in 2 orders.
    • If items may repeat (3 scoops from 4 flavours, two of a kind allowed), use C(n + k − 1, k): C(6, 3) = 20, not 4 choose 3 = 4.
    • nCr, ⁿCₖ, C(n, k) and the binomial coefficient “n over k” are the same number: 4C2 = C(4, 2) = 6.

    See Also

    Last Results

    14 Choose 6: Combinations C(14, 6)
    5 Choose 5: Combinations C(5, 5)
    11 Choose 1: Combinations C(11, 1)
    12 Choose 11: Combinations C(12, 11)
    12 Choose 5: Combinations C(12, 5)
    100 Choose 3: Combinations C(100, 3)
    19 Choose 5: Combinations C(19, 5)
    19 Choose 4: Combinations C(19, 4)
    6 Choose 1: Combinations C(6, 1)
    7 Choose 6: Combinations C(7, 6)
    20 Choose 7: Combinations C(20, 7)
    12 Choose 12: Combinations C(12, 12)
    19 Choose 2: Combinations C(19, 2)
    11 Choose 11: Combinations C(11, 11)
    10 Choose 3: Combinations C(10, 3)
    20 Choose 8: Combinations C(20, 8)
    18 Choose 10: Combinations C(18, 10)
    20 Choose 17: Combinations C(20, 17)
    12 Choose 2: Combinations C(12, 2)
    9 Choose 5: Combinations C(9, 5)
    12 Choose 6: Combinations C(12, 6)
    14 Choose 9: Combinations C(14, 9)
    17 Choose 7: Combinations C(17, 7)
    13 Choose 5: Combinations C(13, 5)
    11 Choose 4: Combinations C(11, 4)
    12 Choose 10: Combinations C(12, 10)
    15 Choose 14: Combinations C(15, 14)
    9 Choose 0: Combinations C(9, 0)
    18 Choose 2: Combinations C(18, 2)
    11 Choose 9: Combinations C(11, 9)
    20 Choose 12: Combinations C(20, 12)
    1 Choose 2: Combinations C(1, 2)
    15 Choose 9: Combinations C(15, 9)
    6 Choose 3: Combinations C(6, 3)
    9 Choose 1: Combinations C(9, 1)
    15 Choose 8: Combinations C(15, 8)
    20 Choose 1: Combinations C(20, 1)
    11 Choose 7: Combinations C(11, 7)
    7 Choose 0: Combinations C(7, 0)
    17 Choose 5: Combinations C(17, 5)
    20 Choose 2: Combinations C(20, 2)
    19 Choose 0: Combinations C(19, 0)
    8 Choose 2: Combinations C(8, 2)
    18 Choose 8: Combinations C(18, 8)
    16 Choose 1: Combinations C(16, 1)
    10 Choose 5: Combinations C(10, 5)
    4 Choose 4: Combinations C(4, 4)
    7 Choose 4: Combinations C(7, 4)
    15 Choose 5: Combinations C(15, 5)
    16 Choose 2: Combinations C(16, 2)
    7 Choose 7: Combinations C(7, 7)
    13 Choose 11: Combinations C(13, 11)
    15 Choose 3: Combinations C(15, 3)
    18 Choose 4: Combinations C(18, 4)
    10 Choose 4: Combinations C(10, 4)
    19 Choose 12: Combinations C(19, 12)

    FAQ

    What is the combination formula?

    C(n, k) = n! / (k! (n − k)!). The factorials cancel down to a short product: multiply k numbers counting down from n and divide by k!. For 5 choose 2 that is (5 × 4) / (2 × 1) = 10.

    What is the difference between combinations and permutations?

    Combinations ignore order — {A, B} and {B, A} are one choice; permutations count every order separately. So P(n, k) = C(n, k) × k!: from 5 items there are 10 pairs but 20 ordered pairs.

    Why is C(n, k) equal to C(n, n − k)?

    Choosing k items is the same as choosing the n − k you leave out. So 10 choose 8 = 10 choose 2 = 45, and it is quicker to compute through the smaller k.