Need to calculate permutations? Our free Permutation Calculator handles all types of ordered arrangements. Calculate standard permutations (nPr), permutations with repetition, circular permutations, and derangements. Understand the difference between permutations and combinations with clear explanations and examples. Perfect for statistics students, probability calculations, combinatorics problems, password security analysis, and scheduling applications. The calculator shows the formula used, step-by-step calculations, and explains when to use each type of permutation. All calculations happen instantly in your browser with support for large numbers using logarithms when needed. No signups, no limits, completely free.
A permutation is an arrangement of objects where the order matters. In permutations, ABC is considered different from BAC - the sequence is important. Our calculator handles several types of permutations: Standard Permutations (nPr): The number of ways to arrange r items from a set of n items without repetition. Formula: nPr = n! / (n-r)!. Permutations with Repetition: When items can be used more than once. Formula: n^r. Circular Permutations: Arrangements around a circle where rotations are identical. Formula: (n-1)!. Derangements: Permutations where no item appears in its original position. Formula: !n ≈ n!/e. The calculator determines which formula applies based on your inputs and provides step-by-step solutions showing factorial calculations, cancellations, and final results.
Our calculator computes standard permutations (nPr), permutations with repetition (n^r), circular permutations ((n-1)!), and derangements. It shows the formula used and step-by-step factorial calculations, handles large numbers using logarithms and scientific notation, compares permutation and combination counts side by side, provides real-world examples for each permutation type, validates inputs (n >= r for standard permutations), and supports both exact and approximate results for very large values.
Using the Permutation Calculator is simple: First, enter your values. Input n (total number of items) and r (number of items to arrange). For standard permutations, ensure n ≥ r. Select the permutation type based on your problem: Standard (no repetition), With repetition, Circular, or Derangement. Next, click Calculate. The calculator applies the appropriate formula, shows the factorial calculations, performs any necessary cancellations, and handles large numbers using logarithms when needed. Finally, review comprehensive results including: The calculated number of permutations, The formula used and step-by-step work, Comparison with combination count (if applicable), Probability information (if relevant), Explanation of why this formula applies. Copy results for use in homework, research, or professional applications.
Statistics students use permutations to calculate arrangements when order matters for probability problems. Combinatorics courses teach permutations as fundamental counting principles with real-world applications. Data scientists calculate possible arrangements in algorithm design and complexity analysis. Gamblers determine odds for ordered outcomes in games and lotteries. Computer scientists implement permutations in sorting algorithms and backtracking solutions. Researchers calculate experimental design arrangements where sequence affects results. Educators demonstrate fundamental counting principles with concrete permutation examples. Cryptographers analyze permutation-based encryption algorithms and their security.
Accurate Calculations - Permutations involve large factorials that are error-prone to calculate manually. Our calculator handles arbitrary precision and uses logarithms for very large numbers. Multiple Permutation Types - Unlike basic calculators, we support standard permutations, permutations with repetition, circular permutations, and derangements - all with clear explanations of when to use each. Permutation vs Combination - Confused about which to use? The calculator includes both and explains the difference with examples. See at a glance how order affects the count. Step-by-Step Work - Understanding the reasoning is as important as the answer. The calculator shows factorial expansions, cancellations, and the mathematical reasoning. Large Number Support - Factorials grow incredibly fast (20! > 2 quintillion). The calculator handles large values using logarithms and scientific notation when needed. Educational Value - Students can verify their manual calculations, understand common mistakes, and learn when each permutation type applies. Real-World Applications - From password security to scheduling to genetics, permutations appear everywhere. The calculator includes examples from many fields. Free & Instant - No software installation or expensive calculator needed. Access professional combinatorics tools from any browser.
Statistics and Probability Students - Essential for combinatorics, probability theory, and statistical sampling courses. Calculate arrangements for probability problems and understand counting principles. Computer Science Students - Permutations are fundamental to algorithm analysis, cryptography, password generation, and computational complexity. Verify calculations for Big-O analysis. Mathematics Students - From high school algebra to college combinatorics, permutations are a core concept. Get help with homework and prepare for exams. Data Scientists and Analysts - Calculate sample sizes, permutation tests, and bootstrap resampling scenarios. Understand the combinatorics behind statistical methods. Security Professionals - Analyze password strength, calculate key space sizes, and understand the mathematics behind encryption. Geneticists and Biologists - Calculate DNA sequence possibilities, gene arrangement probabilities, and understand the combinatorics of molecular structures. Operations Researchers - Optimize scheduling, routing, and resource allocation problems that involve permutations of tasks or resources. Game Developers - Calculate game state spaces, card shuffle possibilities, and procedural generation combinatorics. Quality Control Engineers - Design test sequences, calculate inspection coverage, and understand permutation-based sampling strategies. Cryptography Enthusiasts - Explore the mathematical foundations of modern encryption, hash functions, and random number generation. Lottery and Gambling Analysts - Understand the mathematics behind games of chance (for educational purposes - we don't promote gambling).
Getting started with the Permutation Calculator is simple. Enter n—the total number of distinct items in your set. Enter r—the number of items you are selecting or arranging. Select whether you want permutations with repetition allowed or without repetition (classic permutation). Click Calculate to see the result with the step-by-step formula breakdown. The calculator uses P(n,r) = n! / (n-r)! for permutations without repetition. Review the factorial calculation to understand how the arrangement count is determined. Use the result for probability, combinatorics, or algorithm design applications.
Always verify that order matters before using permutations—if order does not matter, use combinations instead. Ensure your n and r values are non-negative integers with r ≤ n for valid permutations. For large values (n > 20), results may be extremely large—consider logarithmic approximations. Verify you are counting distinct items; identical items require multinomial coefficient adjustments. Double-check your calculator is set correctly for with/without repetition based on your problem. Document your calculation steps to verify logical consistency with expected outcomes.
This calculator handles standard permutation calculations with integer inputs. Very large values (factorials > 170!) may cause overflow as they exceed JavaScript number representation limits. It assumes distinct items—problems with identical objects require multinomial coefficient calculations. The calculator does not solve advanced combinatorics problems like derangements or circular permutations directly. Complex selection scenarios with multiple constraints may need manual combinatorial analysis. Real-world probability often requires additional probability rules beyond simple permutation counting.
A permutation is an arrangement of objects where the order matters. Unlike combinations, different orderings of the same items count as different permutations. Standard Permutation Formula: nPr = n! / (n-r)!, where n = total number of items, r = number of items being arranged, ! denotes factorial. Example: How many ways can you arrange 3 books from a shelf of 5? n = 5, r = 3. 5P3 = 5! / (5-3)! = 5! / 2! = (5×4×3×2×1) / (2×1) = 120 / 2 = 60 ways. Why Order Matters: If arranging books A, B, C, the permutations include: ABC, ACB, BAC, BCA, CAB, CBA - all count as different arrangements. Types of Permutations: Standard Permutations - Without repetition, each item used once. nPr = n! / (n-r)!. Permutations with Repetition - Items can be reused. n^r. Circular Permutations - Arranged in a circle. (n-1)!. Derangements - No item in its original position. Our calculator handles all these types with step-by-step explanations.
The key difference is whether order matters: Permutation (nPr): Order matters. ABC is different from BAC. Use when arranging, scheduling, or ranking. Formula: nPr = n! / (n-r)!. Combination (nCr): Order doesn't matter. ABC is the same as BAC. Use when selecting teams, choosing items, or grouping. Formula: nCr = n! / (r!(n-r)!). Visual Example: Selecting a president and vice-president from 5 people: Permutation (order matters): 5P2 = 5! / 3! = 20 ways. Choosing a 2-person committee from 5 people: Combination (order doesn't matter): 5C2 = 5! / (2!3!) = 10 ways. When to Use Each: Use Permutations When: Arranging people in seats, creating ordered lists, determining race finishing positions, creating passwords or codes, scheduling tasks in sequence. Use Combinations When: Selecting team members, choosing lottery numbers, forming committees, selecting items from a menu, grouping objects without regard to order. Memory Trick: Permutation = Position matters (both start with P). Combination = Choice matters (grouping, selecting). Our calculator includes both permutation and combination calculations for easy comparison.
Permutations with repetition allow items to be used more than once in the arrangement. Formula: n^r, where n = number of choices for each position, r = number of positions. Example: How many 3-digit codes using digits 0-9? Each digit can repeat: 10 choices (0-9) for each of 3 positions: 10³ = 1,000 possible codes. Example: How many ways to arrange 3 letters (A-Z) allowing repeats? 26³ = 17,576 arrangements. Real-World Applications: PIN Codes - 4 digits, 0-9, repeats allowed: 10⁴ = 10,000 combinations. License Plates - 3 letters × 3 digits: 26³ × 10³ = 17,576,000 combinations. Passwords - With character repeats allowed, exponentially more possibilities. Phone Numbers - Area codes and exchanges with repetition. Contrast with Standard Permutations: Without repetition (standard): 10P3 = 10! / 7! = 720 arrangements. With repetition: 10³ = 1,000 arrangements. Note: With repetition allows more possibilities when r < n, but fewer when using all items (r = n). Our calculator handles both cases and shows which formula applies.
Circular permutations arrange items in a circle or ring where rotations of the same arrangement are considered identical. Formula: (n-1)!, where n = number of items. Why (n-1)! and not n!? In a circle, there's no 'first' position. Rotating an arrangement doesn't create a new permutation. Fixing one item eliminates rotational duplicates. Example: Arranging 4 people around a circular table: Linear arrangement: 4! = 24 ways. Circular arrangement: (4-1)! = 3! = 6 ways. Visualization: In a line: ABCD, ABDC, ACBD, ACDB, ADBC, ADCB, BACD... (24 total). In a circle: ABCD = BCDA = CDAB = DABC (same arrangement, just rotated). So we fix A and arrange B, C, D: 3! = 6 unique circular arrangements. Special Case - Necklace/Bracelet: Can be flipped over, so divide by 2: Formula = (n-1)! / 2. Real-World Applications: Seating arrangements at round tables. Rotating schedules or shifts. Bead arrangements in jewelry. Molecule structures in chemistry. Planting arrangements in circular gardens. Our calculator includes circular permutation mode for these scenarios.
Many permutation problems have restrictions that modify the calculation: Certain Items Must Be Together: Treat the grouped items as a single unit. Calculate permutations of units, then multiply by arrangements within the group. Example: Arrange A, B, C, D where A and B must be adjacent. Treat AB as one unit: (AB), C, D = 3 items = 3! = 6 arrangements. A and B can be AB or BA: × 2 = 12 total. Certain Items Cannot Be Together: Calculate total permutations minus permutations where they're together. Example: Arrange A, B, C, D where A and B cannot be adjacent. Total: 4! = 24. Together: 12 (from above). Answer: 24 - 12 = 12. Items Must Be in Specific Positions: Fix those items, arrange the rest. Example: Arrange 5 people where person A must be first. Fix A in position 1, arrange remaining 4: 4! = 24. Items Cannot Be in Specific Positions: Use inclusion-exclusion principle or complementary counting. Conditional Permutations: Specific items in even positions, others in odd positions, etc. Our calculator provides modes for common restrictions and explains the reasoning.
A derangement is a permutation where no element appears in its original position. It's a permutation with complete displacement. Derangement Formula: !n = n! × (1 - 1/1! + 1/2! - 1/3! + ... + (-1)ⁿ/n!), or approximately !n ≈ n! / e (where e ≈ 2.71828), rounded to nearest integer. Examples: !1 = 0 (impossible), !2 = 1 (swap only), !3 = 2, !4 = 9, !5 = 44, !6 = 265. Classic Derangement Problem: The Hat-Check Problem: n people check their hats. How many ways can hats be returned so no one gets their own hat? Answer: !n. For 5 people: !5 = 44 ways. Real-World Applications: Secret Santa - No one draws their own name. Assignment problems - No one gets their preferred/previous assignment. Error-correcting codes. Cryptography and security. Probability of derangement: As n increases, probability approaches 1/e ≈ 36.8%. Our calculator includes derangement mode for these specialized counting problems.
Permutations have countless practical applications: Security and Passwords: Calculating password possibilities. PIN code combinations. Lock combinations. License plate arrangements. Scheduling and Planning: Tournament brackets and scheduling. Class schedules with time slots. Employee shift rotations. Delivery route planning. Statistics and Probability: Lottery odds calculations. Card game probabilities. Statistical sampling arrangements. Quality control testing sequences. Computer Science: Sorting algorithm analysis. Password generation. Data encryption keys. Hash function collision analysis. Genetics: DNA sequence arrangements. Gene ordering on chromosomes. Protein folding possibilities. Games and Puzzles: Rubik's cube configurations (43 quintillion+). Sudoku solution counts. Chess game possibilities. Scrabble tile arrangements. Business: Queue management. Priority ordering. Task scheduling optimization. Resource allocation. Sports: Playoff bracket arrangements. Starting lineup orders. Race finishing position predictions. Our calculator supports all these applications with accurate calculations and clear explanations.
Avoid these common errors: Confusing Permutations and Combinations: Using nCr when order matters (should use nPr). Using nPr when order doesn't matter (should use nCr). Remember: Permutation = Position matters (arrangements). Incorrect Factorial Calculation: 0! = 1 (not 0). Factorial is only defined for non-negative integers. n! grows extremely fast - be careful with large numbers. Off-by-One Errors: Using n instead of (n-1) for circular permutations. Forgetting that n must be ≥ r for standard permutations. Repetition Confusion: Using standard permutation formula when repetition is allowed (should be n^r). Not accounting for identical items (use multinomial coefficient). Restriction Mistakes: Double-counting when items 'must be together'. Forgetting to multiply by internal arrangements of grouped items. Not using complementary counting for 'must NOT be together' problems. Overflow Errors: Factorials exceed standard calculator limits quickly (13! = 6.2 billion, 21! > 64-bit limit). Use logarithms or approximation for very large values. Probability Misconceptions: Confusing number of permutations with probability. Each specific permutation may have equal probability, but 'number of favorable permutations' is different from 'probability'. Our calculator helps avoid these mistakes by clearly showing which formula applies and providing step-by-step work.