Combinatorics Calculator (Permutations & Combinations)
Calculate permutations, variations, and combinations (with and without repetition) with clear step-by-step derivations. Features an interactive decision tree, urn model visualizer, and practice trainer.
⚙️Kombinatorisches Modell auswählen
Wähle zwischen Permutation, Variation oder Kombination mit/ohne Wiederholung.
Werden alle n Elemente angeordnet?
Spielt die Ziehungsreihenfolge eine Rolle?
Dürfen Elemente mehrfach vorkommen?
Mit einem Griff werden k Kugeln gleichzeitig aus der Urne mit n Kugeln gezogen. Die Reihenfolge ist egal.
📝Ausführlicher Rechenweg & mathematische Begründung
Da die Ziehungsreihenfolge irrelevant ist, teilt man die Variation durch $k!$:
Kombinationen für $n = 49$ und $k = 6$:
Historical Origin & The Challenge Solved
Why was this mathematics developed, where does it come from, and what real-world problem did it solve?
1. Cryptography, Secret Ciphers & Combination Locks
Diplomats and military commanders encrypted state secrets via letter substitutions. To crack codes or forge unpickable combination locks, one had to compute exactly how many permutations and combinations existed.
2. De Arte Combinatoria & Factorials
At age 20, Leibniz published "Dissertatio de Arte Combinatoria" (1666). He formalized factorials (n!), permutations, variations, and combinations into a systematic discipline of logical counting.
3. Cybersecurity, Genomics & Network Routing
Password entropy calculations against brute-force attacks, genomic DNA sequencing permutations, and logistics routing algorithms rely on combinatorics.
Praxisnutzen & Reale Anwendungsfälle
Warum lernen wir das? So wird diese Mathematik in Wirtschaft, Technik, Wissenschaft und Alltag praktisch angewendet:
Password Entropy & Brute Force
Security analysts calculate keyspaces to assess cryptographic strength against brute-force attacks.
An 8-character password from 62 alphanumeric characters has 62^8 ≈ 2.18 · 10^14 combinations.
Lotteries & Card Games (Poker)
Calculating exact win probabilities by taking favorable outcomes over total possible combinations.
In 5-card poker, there are (52 choose 5) = 2,598,960 possible hands from a standard deck.
DNA Codons & Amino Acids
Counting sequence configurations for genetic coding across base pairs A, C, G, and T.
A 3-base codon yields 4^3 = 64 possible combinations encoding 20 amino acids.
Mathematical Foundations: Combinatorics & Urn Models
Combinatorics deals with counting the number of possible arrangements (permutations) or selections (variations and combinations) of k elements from a set of n elements. Choosing the right formula depends on whether order matters and whether repetition is allowed.
For ordered arrangements, we distinguish permutations without repetition (P_n = n!), variations without repetition (V = n! / (n-k)!), and variations with repetition (V = n^k, e.g. PIN codes or combination locks).
For unordered selections, we use combinations. Combination without repetition is the binomial coefficient (n choose k) = n! / (k!(n-k)!), famous from lottery draws. Combination with repetition is calculated via (n+k-1 choose k).
Frequently Asked Questions (FAQ) about Combinatorics
What is the difference between combination and permutation/variation?
In permutations and variations, the order of elements matters (e.g. 1st, 2nd, 3rd place). In combinations, the order does not matter (e.g. lottery numbers or a team selection).
When do I use factorial n!?
Factorial n! is used when arranging all n distinct items in a complete sequence without repetition.
How does the combinatorics decision tree work?
It guides you through three questions: 1. Are all elements used? 2. Does order matter? 3. Is replacement/repetition allowed?