Permutations: How to Count Ordered Arrangements Without Second-Guessing Your Setup

You’re holding the formula—nPr = n!/(n-r)!—and you know it counts arrangements where order matters. The notation is compact, the concept makes sense, but when you’re actually setting up a problem under pressure, you freeze on whether n is the number you’re selecting or the number you have available, and whether r goes in the numerator or the denominator or both.

The FE gives you counting problems disguised as real scenarios. How many ways to assign project roles. How many seating arrangements. How many different task sequences.

The math itself is straightforward—factorials and division—but the setup requires you to identify what you’re working with, what you’re selecting, and whether you’re using all available objects or just a subset.

Get the setup wrong and your answer is off by factors of 10, 100, or 1,000. You’ll calculate 120 when the answer is 6,840, or you’ll expand 20! by hand when three terms would’ve been enough.

This guide walks you through a systematic approach that works on any permutation problem the FE throws at you—from basic “arrange all items” setups to problems where you’re selecting and arranging a subset under time constraints.

You’ll learn exactly when to use the permutation formula, how to identify n and r without flipping them, how to simplify factorial expressions through cancellation instead of expansion, and how to verify your setup matches what the problem is actually asking.

The goal here is to turn every permutation problem into the same clean process: confirm order matters, identify your pool and your selection count, set up the formula, simplify efficiently, and calculate with confidence.

Before we walk through it step by step, watch this short video. It shows you the full process from recognizing that order creates distinction to setting up the permutation formula to simplifying factorials without unnecessary expansion.

You’ll see exactly where students lose time—confusing permutations with combinations, expanding every factorial term instead of canceling, flipping n and r—and how the workflow prevents those traps completely.

What Is a Permutation?

A permutation counts the number of distinct ways you can arrange objects when the order of arrangement matters.

If you’re assigning eight people to eight numbered seats, swapping person A from seat 1 to seat 2 creates a different arrangement—that’s why order matters.

If you’re choosing three officers (president, vice president, secretary) from a group of twelve, Alice as president and Bob as vice president is different from Bob as president and Alice as vice president—order matters again.

Think of it like building a password from a set of characters. “ABC” is not the same as “CAB” even though they use the same three letters. The sequence defines the outcome.

On the FE, permutations show up when you’re counting arrangements, rankings, assignments, sequences, or any scenario where swapping positions changes the result.

The problems might ask about seating charts, task orderings, role assignments, or tournament brackets—anything where position or rank creates distinction.

The formula that handles this is nPr = n!/(n-r)!, where n is the total number of distinct objects you have available, and r is the number of objects you’re selecting and arranging at a time.

The Permutation Process

These problems create uncertainty at the exact moment you see the setup and have to decide: am I using all available objects, or just selecting some of them? And does the denominator cancel most of the numerator, or do I need to expand everything?

Students either assume they remember the formula and rush the setup without confirming what n and r actually represent, or they freeze trying to recall whether it’s n!/(n-r)! or n!/r! or something else entirely.

The workflow turns that uncertainty into a clean, repeatable process. It forces you to identify what you have, what you’re using, and how the formula simplifies before you start calculating.

Let’s lay out the steps.

Step 1: Confirm that order matters

Read the problem carefully and identify whether the arrangement or sequence of objects affects the outcome.

If the problem uses words like “arrange,” “order,” “assign,” “rank,” “sequence,” or asks “in how many ways,” that’s a signal that order matters. If swapping two objects creates a different outcome, you’re dealing with permutations.

As you read, watch for phrases that indicate distinct positions or roles. Problems might refer to your available objects using terms like “members,” “candidates,” “items,” “people,” “tasks,” or “positions.”

They might refer to what you’re selecting using terms like “roles,” “seats,” “rankings,” “assignments,” or “orderings.”

Your job in this step is to confirm that position or sequence creates distinction, which means you need permutations rather than combinations.

Step 2: Identify n and r

Now that you’ve confirmed order matters, identify what you’re working with.

n is the total number of distinct objects available to choose from. This is your pool—the full set you’re selecting from.

r is the number of objects you’re actually selecting and arranging at a time. This is how many positions you’re filling or how many items you’re arranging in sequence.

Write this down clearly: n = [total available], r = [number being selected and arranged].

If the problem says “arrange all eight pictures on the wall,” then n = 8 and r = 8 because you’re using all available objects.

If the problem says “select three officers from twenty members,” then n = 20 and r = 3 because you’re choosing and arranging three from a larger pool.

Step 3: Set up the permutation formula

With n and r identified, write the permutation formula: nPr = n!/(n-r)!

Substitute your values: [n]!/([n]-[r])!

If r = n (you’re using all available objects), the denominator becomes (n-n)! = 0! = 1, which means the formula simplifies to just n!.

If r < n (you’re selecting a subset), keep the full formula.

This substitution step prevents confusion later. You’re locking in the structure before you start expanding or simplifying factorials.

Step 4: Simplify and calculate

Now simplify the factorial expression before calculating.

If you have n!/(n-r)!, recognize that the denominator cancels most of the numerator. You don’t need to expand the entire factorial.

For example, 20!/17! = (20 × 19 × 18 × 17 × 16 × … × 1)/(17 × 16 × … × 1). Everything from 17 down cancels, leaving you with just 20 × 19 × 18.

Write out only the terms that don’t cancel: n × (n-1) × (n-2) × … × (n-r+1).

Then calculate the product. Use your calculator’s factorial function if available, or multiply the simplified terms directly.

The result is the number of distinct permutations—the number of ways to arrange r objects selected from n distinct objects.

With that laid out, let’s put these steps into practice.

Example Problem: Permutations

The workflow handles any permutation setup on the FE, whether you’re arranging all available objects or selecting and arranging a subset.

This example walks through the case where you’re using all available objects, so you’ll see exactly how the formula simplifies and where to verify your setup before calculating.

This problem states:

Solution: Permutations

When you see a problem about assigning people to distinct roles, the instinct is to recognize that order matters, but the uncertainty hits when you’re setting up the formula and you’re not sure if you should write 5! or 5!/(5-something)! or if there’s a different structure entirely.

Rushing makes you skip the setup and guess at the formula. Freezing makes you burn time trying to remember every factorial rule you’ve ever seen.

This is exactly why we use a workflow—it turns guessing into structured execution and doubt into a setup you can verify before calculating.

I’m going to walk it out step by step, the same way I would across the table.

Step 1: Confirm that order matters

The first thing we need to do is read through the problem statement and confirm whether the arrangement or sequence of assignments affects the outcome.

The problem asks how many ways we can assign five employees to five different roles: lead engineer, quality manager, safety officer, cost analyst, and scheduler.

Because each role is distinct, assigning Employee A as lead engineer and Employee B as quality manager is different from assigning Employee B as lead engineer and Employee A as quality manager.

The roles are not interchangeable—position matters.

That confirms we’re dealing with permutations, not combinations.

Step 2: Identify n and r

Next, we need to identify our total pool of objects and how many we’re selecting and arranging.

n is the total number of employees available to assign: n = 5.

r is the number of roles we’re filling at the same time: r = 5.

Since we’re assigning all five employees to all five roles, we’re using every available object. That means r = n, which will simplify our formula in the next step.

Step 3: Set up the permutation formula

With n = 5 and r = 5, we now set up the permutation formula: nPr = n!/(n-r)!

Substituting our values:

5!/(5-5)! = 5!/0!

Since 0! = 1 (this is a special definition of factorials that always holds), the formula simplifies to just 5!.

Step 4: Simplify and calculate

Now we just need to calculate 5!.

5! = 5 × 4 × 3 × 2 × 1

5! = 120

So the final answer to this problem is B) 120.

This tells us there are 120 distinct ways to assign five employees to five different project roles when each role is unique and order matters.

Common Mistakes to Avoid on Permutation Problems

Permutation problems break at the exact moment you confuse the setup with combinations, forget that 0! = 1, or expand factorials unnecessarily and introduce arithmetic errors.

You know how to count arrangements, but the mistakes happen when you rush the formula or skip the simplification step.

Mistake 1: Confusing permutations with combinations

This happens when you see a counting problem and assume order doesn’t matter, so you use the combination formula n!/[r!(n-r)!] instead of the permutation formula n!/(n-r)!.

On the FE, if the problem asks “how many ways to select” without mentioning positions or roles, you might jump to combinations.

But if it asks “how many ways to assign,” “arrange,” “rank,” or uses distinct position language, order matters—and that requires permutations.

The confusion costs you because combinations divide by r!, which gives a much smaller count.

If you’re arranging 3 items from 5, permutations give you 60 arrangements (5 × 4 × 3). Combinations give you 10 selections (60 ÷ 6). Those are wildly different answers.

Mistake 2: Forgetting that 0! = 1

This happens when you set up a problem where r = n, substitute into the formula, and see 0! in the denominator.

If you don’t remember that 0! is defined as 1, you might think the formula breaks or that you’ve made a setup error.

On the FE, if you’re arranging all available objects (like assigning 5 people to 5 roles), the formula becomes n!/0!.

If you freeze here or try to rewrite the problem, you waste time. If you treat 0! as undefined or zero, you get the wrong answer.

Mistake 3: Expanding factorials unnecessarily

This happens when you see something like 20!/17! and decide to write out every term: 20 × 19 × 18 × 17 × 16 × 15 × … all the way down to 1, then do the same for the denominator.

On the FE, time is tight. Writing out forty terms, then writing out seventeen more terms, then trying to divide them creates opportunities for arithmetic errors and burns through your time budget.

You’ll get the same answer, but you’ll take three times as long.

Mistake 4: Mixing up n and r

This happens when you read the problem, identify the numbers, but assign them to the wrong variables.

You might see “select 3 officers from 12 members” and write n = 3, r = 12 instead of n = 12, r = 3.

On the FE, this flips your setup completely. If you calculate 3!/9! instead of 12!/9!, you get a nonsense answer because you’re trying to divide by a larger factorial than your numerator.

Or you might get a tiny decimal when you should be getting thousands.

Mistake 5: Calculating permutations when repetition is allowed

This happens when the problem allows the same object to be used multiple times (like a password where you can repeat digits), but you use the standard permutation formula which assumes each object is used at most once.

On the FE, if you see language like “with replacement” or “digits may be repeated,” that’s a signal you’re dealing with a different counting principle—not standard permutations.

Using n!/(n-r)! will undercount the arrangements because it removes objects from the pool after each selection.

Rules of Thumb for Permutation Problems on the FE

You know how to set up the permutation formula and simplify factorial expressions. These rules are what keep you from confusing permutations with combinations or expanding factorials when cancellation is faster.

• Order language triggers permutations: If the problem uses words like “arrange,” “assign,” “rank,” “sequence,” or asks “in how many ways,” that’s a signal order matters. Don’t second-guess the setup—if swapping positions creates a different outcome, you’re using permutations, not combinations.
• When r = n, the formula is just n!: If you’re arranging all available objects (like seating 7 people in 7 chairs), the denominator becomes 0!, which equals 1. Don’t waste time writing n!/(n-n)!—just simplify immediately to n! and calculate.
• Cancel before expanding: Factorial division like n!/(n-r)! allows you to cancel everything from (n-r) down to 1. Write out only the terms that don’t cancel—n × (n-1) × (n-2) × … × (n-r+1)—then multiply. This saves time and reduces arithmetic errors.
• Verify magnitude before finalizing: If you’re arranging 3 items from 10, expect thousands of arrangements (10 × 9 × 8 = 720). If you’re arranging all 6 items from 6, expect hundreds of thousands (6! = 720). If your answer is surprisingly small or large, recheck your setup.
• Distinguish permutations from combinations early: Combinations divide by r! because order doesn’t matter. Permutations don’t divide by r! because order does matter. If you confuse the two, your count will be off by a factor of r!. Lock in whether position matters before you write the formula.
• Remember 0! = 1 always: When you see 0! in the denominator, don’t freeze or think the formula broke. 0! is defined as 1, which means n!/0! simplifies to n!. This shows up every time you arrange all available objects.

You’ve seen the workflow, you’ve worked through an example, and you know where mistakes happen. These rules are what protect you when you’re moving fast and the setup starts to blur.

Final Thoughts | Permutations

The single point of failure on permutation problems isn’t the math—it’s the moment you have to decide whether you’re counting ordered arrangements or unordered selections, and whether you’re using all available objects or just picking a subset.

That decision happens in the first fifteen seconds, before you write down a single factorial.

Get it right, and the rest is arithmetic. Get it wrong, and you’ll calculate 10 when the answer is 60, or you’ll expand 20! by hand when three terms would’ve done it.

The workflow protects that decision point. Step 1 confirms order matters. Step 2 locks in what n and r actually represent. Step 3 sets up the formula based on whether r equals n or not. Step 4 simplifies through cancellation instead of expansion.

The mistakes you’ve seen—confusing permutations with combinations, forgetting 0! = 1, flipping n and r, expanding unnecessarily—all happen when you skip the structure and trust your memory under pressure. The workflow removes that vulnerability.

Looking to stack more practice? Explore our complete FE problem library here.

The gap between knowing what a permutation is and actually setting one up correctly under time pressure isn’t conceptual understanding—you already know that order creates distinction and that factorials count arrangements.

The gap is execution confidence.

It’s knowing you identified n and r correctly. It’s recognizing when the formula simplifies to n! versus when you need the full n!/(n-r)!. It’s catching yourself before you expand 18! when cancellation gives you the answer in three steps.

That confidence doesn’t come from reading about permutations. It comes from drilling the setup until the workflow is automatic—until you can look at any counting problem and immediately know whether order matters, what your pool is, what your selection count is, and how the formula simplifies.

Prepineer builds that automaticity. You get a personalized roadmap that prioritizes permutations, combinations, probability, and every other counting principle the FE tests. You get targeted practice that forces you to distinguish order-matters from order-doesn’t-matter without second-guessing. You get real coaching when the setup feels ambiguous and you’re not sure which formula applies.

Start your free 7-day trial and turn counting problems into points you bank with confidence, not points you lose to setup errors.