Feedback form
Hi! What do you think?

Drag it here or paste with Ctrl+V

    You can also email us on infocalculat.io

    5 Choose 5

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

    What is 5 choose 5?

    Answer

    5 choose 5 is
    1

    Order doesn't matter, no repeats: 1 way to choose 5 of 5 items.

    There is exactly one way: take all.

    C(5, 5) = 5! / (5! · 0!)

    = 1

    0! = 1 (an empty product), so 5! cancels out completely.

    If order matters (permutations): P(5, 5) = 5 × 4 × 3 × 2 × 1 = 120 — each combination in 5! = 120 orders.

    Row 5 of Pascal's triangle
    k5 choose k
    01
    15
    210
    310
    45
    51

    Row sum: 25 = 32 — all subsets of 5 items.

    See Also

    Share This Calculation
    Print
    https://calculat.io/en/number/combinations/5--5Copy
    <a href="https://calculat.io/en/number/combinations/5--5">5 Choose 5: Combinations C(5, 5) - Calculatio</a>Copy
    Facebook
    Twitter
    Telegram
    WhatsApp
    Viber
    Email
    5 Choose 5: Combinations C(5, 5). 5 choose 5 = 1: the number of ways to choose 5 of 5 items when order doesn't matter and nothing repeats.
    https://calculat.io/en/number/combinations/5--5/generated.jpgCopy

    n choose 5 for other n

    n choose 5Answer
    2 choose 50
    5 choose 51
    6 choose 56
    7 choose 521
    8 choose 556
    9 choose 5126
    10 choose 5252
    11 choose 5462
    12 choose 5792
    13 choose 51,287
    14 choose 52,002
    15 choose 53,003
    16 choose 54,368
    17 choose 56,188
    18 choose 58,568
    Recalculate with different values ↑

    FAQ

    What is 5 choose 5?

    5 choose 5 is 1

    Why is 5 choose 5 the same as 5 choose 0?

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

    How many ways are there if order matters?

    P(5, 5) = 120. The only combination — all 5 items — can be put in order in 5! = 120 ways, so permutations = combinations × k!: P(n, k) = n! / (n − k)!.

    See Also