What is the main difference between permutations and combinations?

In Permutations, the order of selection matters (e.g. ABC and BAC are different). In Combinations, order does not matter (e.g. ABC and BAC represent the same group).

Permutations & Combinations Simulator - AI Math

SOURCE SET (N = 5 items)

SLOT MATHEMATICS ANALYSIS

Permutations (Order Matters, nP_r):

Pos 15options

Pos 24options

Pos 33options

60 arrangements

Combinations (Order Ignored, nC_r = nP_r ÷ r!):

Permutations60ordered

Item 11

Item 22

Item 33

Redundancy Factor (R! = 6)

10 unique subsets

Combinations (10) Order Ignored • Hover to Highlight Permutations

{A, B, C}

{A, B, D}

{A, B, E}

{A, C, D}

{A, C, E}

{A, D, E}

{B, C, D}

{B, C, E}

{B, D, E}

{C, D, E}

Permutations (60) Order Matters • Highlighted on Selection

ABC

ABD

ABE

ACB

ACD

ACE

ADB

ADC

ADE

AEB

AEC

AED

BAC

BAD

BAE

BCA

BCD

BCE

BDA

BDC

BDE

BEA

BEC

BED

CAB

CAD

CAE

CBA

CBD

CBE

CDA

CDB

CDE

CEA

CEB

CED

DAB

DAC

DAE

DBA

DBC

DBE

DCA

DCB

DCE

DEA

DEB

DEC

EAB

EAC

EAD

EBA

EBC

EBD

ECA

ECB

ECD

EDA

EDB

EDC

Arrangement Metrics

Adjust the variables N and R. Notice how selecting fewer items reduces both counts, and how permutations grow much faster than combinations due to factorial scaling ($R!$).

Total Permutations60

Total Combinations10

Order Redundancy Factor (R!):6

For every combination, there are $r! = 6$ ways to arrange it. Dividing total permutations by $r!$ gives combinations.

Variable Adjuster

Total Items (n)5

Selected Items (r)3

Permutations & Combinations Explorer

PERM

Permutations (order matters) represent sequential arrangements of items, where switching sequence creates a new outcome. Combinations (order does not matter) represent subset groupings, where arrangements of the same items collapse into a single set.

_nP_r = \frac{n!}{(n-r)!} \quad \text{vs} \quad _nC_r = \frac{n!}{r!(n-r)!}

Whiteboard Solver Steps

Step 1

Step 1: Compute Factorials

Factorial ( $n!$ ) represents the number of ways to arrange $n$ items. We calculate factorials for the total elements ( $n$ ), selected elements ( $r$ ), and remaining elements ( $(n-r)$ ) to serve as building blocks for our formulas.

n! = 5! = 120, \quad r! = 3! = 6, \quad (n-r)! = (5-3)! = 2

Step 2

Step 2: Permutations (Order Matters)

Permutation describes arrangement where sequence order is critical (e.g. passcodes). Using the slot method, we fill $r = 3$ positions one-by-one: \text{Slots} = 5 \times 4 \times 3 = 60

_nP_r = \frac{n!}{(n-r)!} = \frac{120}{2} = 60

Step 3

Step 3: Combinations (Order Does Not Matter)

Combination describes subset groupings where sequence order is ignored (e.g. lottery balls). Because ordering is irrelevant, we divide the total permutations ( $^nP_r$ ) by the redundancy factor ( $r! = 6$ ), collapsing arrangements like ABC and CBA into a single unique set.

_nC_r = \frac{n!}{r!(n-r)!} = \frac{_nP_r}{r!} = \frac{60}{3!} = 10

Step 4

Step 4: Machine Learning & Coding Applications

Where it is used: - Feature Selection: Finding optimal subsets of input features ( $k$ features selected from $d$ total features) uses combinations to size search spaces. - Hyperparameter Grid Search: Testing configurations of parameter combinations. - Network Architectures: Fully connected layers or connection graphs sizing.

\binom{n}{r} \implies \text{Hyperparameter Tuning, Feature Combinations}

RV Anveshana