MathLivek-permutation
Counts the number of ways to choose and arrange k distinct objects in order from a set of n objects. It is used in counting problems where order matters and repetition is not allowed.
P(n,k)=\frac{n!}{(n-k)!}What the symbols mean
| total number of distinct objects available | |
| number of objects chosen and arranged, with \(0 \le k \le n\) |
About this formula
- FieldMathematics
- TopicCombinatorics
- LevelHigh school
- Also calledk-permutation formula, number of k-permutations, permutations of n objects taken k at a time, arrangements without repetition, sequence without repetition count, nPk
- SourceWikidata Q1401935
Write it in Obsidian
MathLive is a free visual math editor for Obsidian. Run Find a formula, type “k-permutation”, and it goes into your note as editable LaTeX. You can also scan formulas from screenshots, PDFs and handwriting.