CalcPermutations Calculator
Calculate permutations of n items taken r at a time.
What is a Permutation?
A permutation counts the number of ways to arrange r objects selected from n distinct objects when order matters. For example, selecting 3 runners from 10 to fill gold/silver/bronze positions: the arrangement (Alice, Bob, Charlie) differs from (Charlie, Bob, Alice). Permutations answer "how many ordered arrangements are possible?"
The permutation formula is P(n,r) = n! / (n-r)!. This calculates arrangements where position matters: race rankings, officer elections (president/vice-president/secretary), password characters, or playlist sequences.
Key distinction: Permutations count ordered arrangements; combinations count unordered groups. Selecting a committee of 3 uses combinations; electing president, VP, and treasurer from those 3 uses permutations.
Formulas Explained
Permutation formula (no repetition):
P(n,r) = n! / (n-r)!
= n × (n-1) × (n-2) × ... × (n-r+1)
Where:
n = total number of distinct objects
r = number of objects to select and arrange
! = factorial (e.g., 5! = 5×4×3×2×1 = 120)
Permutations with repetition allowed:
When items can repeat (like digits in a PIN):
P_rep(n,r) = n^r
Example: 4-digit PIN using digits 0-9: 10^4 = 10,000 combinations.
Relationship to combinations:
P(n,r) = C(n,r) × r!
Permutations = Combinations × arrangements of selected items
Step-by-Step Guide
- Enter total items (n): The complete set size. Example: 10 candidates
- Enter items to select (r): How many to arrange. Example: 3 positions
- Click calculate: The calculator computes P(n,r) = n!/(n-r)!
- Read your result: For P(10,3): result = 720 arrangements
- Verify: 10!/(10-3)! = 10!/7! = 10×9×8 = 720 ✓
Real Examples with Calculations
Example 1: Race podium finishes
12 horses race. How many possible gold/silver/bronze outcomes?
P(12,3) = 12! / 9! = 12 × 11 × 10 = 1,320
Application: Horse racing odds, sports betting, tournament brackets.
Example 2: Corporate officer elections
15 board members elect president, VP, secretary, treasurer (4 distinct roles).
P(15,4) = 15! / 11! = 15 × 14 × 13 × 12 = 32,760
Application: Governance, organizational charts, role assignments.
Example 3: Password security
8-character password from 26 lowercase letters, no repeats.
P(26,8) = 26! / 18! = 26 × 25 × 24 × 23 × 22 × 21 × 20 × 19
= 62,990,928,000 (about 63 billion)
With repeats allowed: 26^8 = 208,827,064,576 (209 billion)
Application: Cybersecurity, password policy, brute-force resistance.
Example 4: Seating chart for head table
Wedding head table seats 8 from 20 wedding party members.
P(20,8) = 20! / 12! = 20 × 19 × 18 × 17 × 16 × 15 × 14 × 13
= 5,079,110,400 (over 5 billion arrangements)
Application: Event planning, seating optimization, diplomatic protocol.
Example 5: Track and field qualifying
24 athletes compete; top 8 advance to finals in ranked lanes.
P(24,8) = 24! / 16! = 24 × 23 × 22 × 21 × 20 × 19 × 18 × 17
= 2,918,472,960 (nearly 3 billion possible lane assignments)
Application: Tournament seeding, lane assignments, qualifying rounds.
4 Common Mistakes
- Using permutations when order doesn't matter: Selecting 3 pizza toppings from 10 uses combinations C(10,3) = 120, not permutations P(10,3) = 720. Pepperoni-mushroom-onion is the same pizza regardless of topping order.
- Confusing P(n,r) with C(n,r): P(10,3) = 720, but C(10,3) = 120. Permutations are always larger by a factor of r! because they count all orderings of each selection.
- Forgetting the repetition rule: A 4-digit PIN allows repeated digits (0000 to 9999), so use n^r = 10^4 = 10,000, not P(10,4) = 5,040. Repetition dramatically increases possibilities.
- Misidentifying n and r: In "select 3 from 10," n=10 (total) and r=3 (selected). Reversing them gives P(3,10), which is undefined (can't select 10 from 3).
4 Pro Tips
- Use the multiplication shortcut: P(n,r) = n × (n-1) × ... × (n-r+1). For P(20,3), compute 20 × 19 × 18 = 6,840 directly without calculating full factorials.
- Recognize when repetition applies: License plates, phone numbers, and passwords typically allow repeats (use n^r). Race results, officer elections, and seating charts don't allow repeats (use P(n,r)).
- Break complex problems into stages: "Arrange 5 people in 8 chairs" = P(8,5) = 6,720. First choose 5 chairs C(8,5) = 56, then arrange 5 people 5! = 120. Total: 56 × 120 = 6,720.
- Estimate magnitude quickly: P(n,r) ≈ n^r for small r relative to n. P(50,3) ≈ 50³ = 125,000. Exact: 50×49×48 = 117,600. Close enough for feasibility checks.
FAQs
Use permutations when order/position matters: rankings, passwords, schedules, seating arrangements. Use combinations when order doesn't matter: committees, lottery numbers, pizza toppings, handshakes. Ask: "If I swap two items, is it different?" If yes → permutations.
P(n,n) = n! / (n-n)! = n! / 0! = n! / 1 = n!. This makes sense: arranging all n objects in order has n! possibilities. Example: arranging 5 books uses all 5, giving 5! = 120 arrangements.
No. P(n,r) is undefined when r > n because you can't select more items than exist. Mathematically, (n-r)! would be negative factorial, which doesn't exist. The calculator returns an error for r > n.
Probability = favorable outcomes / total outcomes. If order matters in both, use permutations. Example: Probability of guessing exact top-3 finishers in 10-horse race = 1/P(10,3) = 1/720 ≈ 0.14%.
Related Calculators
Explore our mathematics calculators: Combinations Calculator, Factorial Calculator, Standard Deviation Calculator, Median Calculator, Percentage Calculator.