Since 2010 · Powering 2M+ tool runs every month
Since 2010
Add to Chrome

My Toolbox

Automatic Mode

No saved tools yet.

Go Premium
Related tools
Same situation
Binomial Theorem Expansion Calculator
More tools
Binomial Coefficient CalculatorPermutation CalculatorPermutations with Repetition CalculatorPigeonhole Principle CalculatorBig Number CalculatorPascal's Triangle GeneratorCloset Capsule Calculator
Home Page > Math > Advanced Math Operations

Combination Calculator

MiniWebtool’s Combination Calculator counts ways to choose k items from n when order is irrelevant. Enter the two values to see C(n, k), its factorial calculation, and a Pascal’s triangle visualization.

Need help using this tool? Ask AI

For Gemini, paste the copied question into the chat. You can also copy it below.

View the question

Free to useNo sign-up requiredInstant Results
Combination CalculatorTry it now — free ▼
Pick 2 of 5: ordered pairs ÷ orders, C(5, 2) = 5·4 / 2! = 10

Enter n and k below to get the number of combinations C(n, k), with the formula steps and Pascal's triangle.

Combination Formula

C(n, k) = n! / (k! × (n-k)!)

Embed Combination Calculator Widget

Combination Result
C(20, 3)
1,140
There are 1,140 ways to choose 3 items from 20 items
n (Total)
20
k (Choose)
3
n - k
17

Step-by-Step Solution

Step 1: Identify the Values

We need to calculate C(20, 3), which represents the number of ways to choose 3 items from 20 items without regard to order.

  • n (total items) = 20
  • k (items to choose) = 3
  • n - k = 17
Step 2: Apply the Combination Formula
$$C(n, k) = \binom{n}{k} = \frac{n!}{k!(n-k)!}$$

This formula calculates how many different groups of k items can be selected from n items, where the order of selection does not matter.

Step 3: Substitute the Values
$$C(20, 3) = \frac{20!}{3! \times (20-3)!} = \frac{20!}{3! \times 17!}$$
Step 4: Calculate the Factorials
  • 20! = 2,432,902,008,176,640,000
  • 3! = 6
  • 17! = 355,687,428,096,000
Step 5: Compute the Result
$$C(20, 3) = \mathbf{1,140}$$

There are 1,140 different ways to choose 3 items from 20 items.

Real-World Applications

Triangles: From 20 non-collinear points, you can form 1,140 unique triangles.
Lottery: Choosing 3 numbers from 20 gives 1,140 possible combinations.

           

✨Want faster & ad-free?
Go Premium

About Combination Calculator

Welcome to the Combination Calculator, a comprehensive tool for calculating combinations C(n,k) with step-by-step solutions, Pascal's Triangle visualization, and interactive diagrams. Whether you are solving probability problems, studying combinatorics, calculating lottery odds, or working on counting problems, this calculator provides detailed explanations and visual representations to help you understand the mathematics behind combinations.

At a Glance

Combination Calculator counts the ways to choose k items from n when order does not matter. It shows C(n, k) with the factorial working and a Pascal's triangle diagram.

Combination Calculator: features at a glance
FeatureWhat you getGood for
C(n, k) resultEnter n up to 170 and k no larger than n. The result is shown with thousands separators.Counting committees, hands or selections from a group
Formula stepsA step-by-step breakdown of C(n, k) = n! / (k!(n-k)!).Checking a combinatorics answer by hand
Pascal's triangleDrawn for n up to 12, with the row for your n showing C(n, 0) through C(n, n).Seeing how combinations relate to neighboring rows
Combination listFor small results, all possible combinations are listed.Viewing the actual groups behind a small count
Preset buttonsQuick presets load common combination problems.Trying typical examples before entering your own numbers
Worked applicationsReal-world examples, such as the 13,983,816 possible tickets in a 6/49 lottery and 2,598,960 five-card poker hands.Probability and lottery odds problems

What is a Combination?

A combination is a selection of items from a larger set where the order of selection does not matter. It answers the question: "In how many ways can I choose k items from n items?"

For example, if you want to choose 3 students from a class of 10 to form a committee, the combination C(10,3) = 120 tells you there are 120 different possible committees. The order in which you select the students doesn't matter - selecting Alice, Bob, then Carol gives the same committee as selecting Carol, Alice, then Bob.

The Combination Formula

Combination Formula
$$C(n, k) = \binom{n}{k} = \frac{n!}{k!(n-k)!}$$

Where:

Combinations vs Permutations

The key difference between combinations and permutations is whether order matters:

Combination Calculator: Combinations vs Permutations
Aspect Combination Permutation
Order Does NOT matter DOES matter
Example {A, B, C} = {C, B, A} ABC ≠ CBA
Formula n! / (k!(n-k)!) n! / (n-k)!
Use Case Selecting committee members Arranging race finishers

For the same n and k values, permutations always yield larger results because they count each group multiple times (once for each possible ordering).

Pascal's Triangle

Pascal's Triangle is a triangular array of numbers where each number is the sum of the two numbers directly above it. The triangle provides a visual way to find combination values:

For example, row 5 of Pascal's Triangle shows: 1, 5, 10, 10, 5, 1, corresponding to C(5,0), C(5,1), C(5,2), C(5,3), C(5,4), C(5,5).

How to Use This Calculator

  1. Enter n (total items): Input the total number of items in your set. The maximum value is 170.
  2. Enter k (items to choose): Input how many items you want to select. This must be less than or equal to n.
  3. Click Calculate: The calculator will compute C(n,k) and display:
    • The final result with thousands separators for readability
    • Step-by-step calculation breakdown
    • Pascal's Triangle visualization (for n ≤ 12)
    • All possible combinations listed (for small results)
    • Real-world application examples
  4. Try preset values: Use the quick preset buttons to explore common combination problems.

Real-World Applications

Lottery and Gambling

Combinations are essential for calculating lottery odds. For a 6/49 lottery (choosing 6 numbers from 49), C(49,6) = 13,983,816 possible combinations, giving odds of about 1 in 14 million.

Probability and Statistics

The binomial probability formula uses combinations: P(X = k) = C(n,k) × p^k × (1-p)^(n-k), where p is the probability of success in a single trial.

Team Selection

When selecting a committee of 5 from 20 candidates, C(20,5) = 15,504 possible committees can be formed.

Card Games

Poker hand probabilities rely on combinations. A standard deck has C(52,5) = 2,598,960 possible 5-card hands.

Handshake Problems

If n people shake hands with everyone exactly once, the total number of handshakes is C(n,2) = n(n-1)/2.

Important Properties of Combinations

Symmetry Property

Symmetry
$$C(n, k) = C(n, n-k)$$

Choosing k items to include is equivalent to choosing (n-k) items to exclude.

Pascal's Identity

Pascal's Identity
$$C(n, k) = C(n-1, k-1) + C(n-1, k)$$

This recursive relationship is why Pascal's Triangle works - each number is the sum of the two above it.

Sum of Row

Row Sum
$$\sum_{k=0}^{n} C(n, k) = 2^n$$

The sum of all combinations in row n equals 2^n, representing all possible subsets of an n-element set.

Frequently Asked Questions

What is a combination in mathematics?

A combination is a selection of items from a larger set where the order of selection does not matter. It is denoted as C(n,k) or "n choose k", representing the number of ways to choose k items from n items. Unlike permutations, combinations treat {A,B,C} and {C,B,A} as the same selection.

What is the formula for combinations?

The combination formula is C(n,k) = n! / (k! × (n-k)!), where n is the total number of items, k is the number of items to choose, and ! denotes factorial. This formula calculates how many different groups of k items can be selected from n items without considering order.

What is the difference between combinations and permutations?

The key difference is order: in combinations, order does not matter (selecting A,B,C is the same as C,B,A), while in permutations, order matters (ABC and CBA are different arrangements). Combinations count groups, permutations count arrangements.

What is Pascal's Triangle and how does it relate to combinations?

Pascal's Triangle is a triangular array where each number is the sum of the two numbers directly above it. The nth row contains the values C(n,0), C(n,1), ..., C(n,n). This provides a visual way to find combination values without calculation.

What are real-world applications of combinations?

Combinations have many practical applications: calculating lottery odds, counting handshakes at a party, determining poker hand probabilities, selecting team members from a group, and solving problems in probability, statistics, and computer science.

Related Calculators

Reference this content, page, or tool as:

"Combination Calculator" at https://MiniWebtool.com/combination-calculator/ from MiniWebtool, https://MiniWebtool.com/

by miniwebtool team. Updated: Jan 18, 2026

Chat with your favorite AI

For Gemini, paste the copied question into the chat. You can also copy it below.

View the question

Advanced Math Operations:

Math SolverWhat would you like to solve?

Math Solver

Try
Browse expression examples

Choose an example to fill the input, edit its numbers, then Solve. log uses base 10; use ln for the natural logarithm.

Numbers & factors

Fractions & division

Powers, roots & logs

Algebra & equations

Calculus

Geometry & trigonometry

Top & Updated:

Derangement (Subfactorial) CalculatorScientific CalculatorFactorial CalculatorView all →
Home Page > Math > Advanced Math Operations > Combination Calculator
×

Do us a favor and answer 3 quick questions

Thank you for participating in our survey. Your input will help us to improve our services.

Where exactly did you first hear about us?

What is your favorite tool on our site?

if Other, please specify:

How likely is it that you would recommend this tool to a friend?

NOT AT ALL LIKELYEXTREMELY LIKELY

Likely score: (1-10)