P(n, r)

p(n, r) is the number of permutations of n distinct objects taken r at a time, without repetition. In Combinatorics, it counts ordered arrangements where order matters and each item is used once.

What is p(n, r)?

p(n, r) is the notation for permutations without repetition in Combinatorics. It tells you how many ordered ways you can choose r distinct objects from a set of n distinct objects, where no object can appear twice.

The big idea is that order matters. If you select A, B, and C in that order, that is different from C, B, and A. That is why p(n, r) is not the same kind of count as a combination. You are not just choosing a group, you are arranging a group.

The formula is p(n, r) = n! / (n - r)!. This works because you multiply the number of choices for the first spot by the number of choices left for the second spot, then the third spot, and so on until you place r items. That product is the same as n(n - 1)(n - 2)... continuing for r factors.

A quick example makes the pattern easier to see. If you have 5 books and want to line up 3 of them on a shelf, the count is p(5, 3) = 5! / 2! = 5 x 4 x 3 = 60. You are not counting which 3 books you picked alone. You are counting each possible order of those 3 books.

One common mistake is using a permutation formula when the order does not matter. If the question says choose, form a committee, or make a group with no order attached, you usually want a combination instead. Another common mistake is forgetting that p(n, r) only works when r is less than or equal to n. If you try to arrange more items than you have, the count is 0.

When r = n, the formula becomes p(n, n) = n!, which is the number of ways to arrange the full set. That is why factorials and permutations show up together so often in counting problems.

Why p(n, r) matters in COMBINATORICS

p(n, r) shows up any time Combinatorics asks you to count ordered outcomes from a limited set. It is the counting move behind lineup questions, seating arrangements, race placements, password-style arrangements, and other problems where position changes the answer.

It also gives you a clean way to build more complicated counting arguments. Many problems start with a permutation count and then add a restriction, such as "the first seat cannot be the captain" or "these two people cannot sit next to each other." Once you recognize p(n, r), you can often break the problem into a first-choice, second-choice, third-choice pattern instead of guessing.

The formula also connects directly to factorials, so it reinforces how counting rules build on each other. That matters in later topics like circular permutations and derangements, where you still count arrangements but the geometry or restriction changes the formula. If you can spot when order matters and repetition is forbidden, you can choose the right tool faster and avoid mixing it up with combinations.

How p(n, r) connects across the course

Factorial

p(n, r) is built from factorials. The formula n! / (n - r)! comes from counting how many choices you have at each step, then compressing that product into factorial notation. If you already know how factorials expand, the permutation formula becomes much easier to read and simplify.

Ordered Arrangements

This is the core idea behind p(n, r). Ordered arrangements treat ABC as different from BAC, so you count each placement separately. That is what makes permutations different from counts where the objects are just collected into a group.

Combinations

Combinations count selections where order does not matter, which is the main contrast with p(n, r). If a problem asks for a team, a hand of cards, or a set of chosen items, combinations are usually the right count. If the same problem cares about position or ranking, p(n, r) is the better fit.

Seating arrangements

Seating problems often use p(n, r) when the seats are in a row and each person can sit only once. You count who can go in the first seat, then the second, and so on. If the seats are around a table, you may need a circular permutation instead, because rotations change how you count.

Is p(n, r) on the COMBINATORICS exam?

A problem set question will usually ask you to count ordered selections, list the first few cases, or choose the correct formula from a word problem. The move is to check two things fast: does order matter, and can an item repeat? If the answer is yes to order and no to repetition, p(n, r) is the count you want.

You may also see it inside a probability setup, where you count the total number of possible arrangements before finding a favorable outcome. In that situation, the permutation count is part of the denominator or numerator, not the final answer by itself. Watch for wording like "arrange," "rank," "line up," or "assign positions" because those are strong clues that the problem is asking for p(n, r).

P(n, r) vs Combinations

These two are easy to mix up because both count selections from a set. The difference is that p(n, r) counts ordered arrangements, while combinations ignore order. If AB and BA count as different outcomes, use permutations. If they mean the same group, use combinations.

Key things to remember about p(n, r)

• p(n, r) counts ordered arrangements of r distinct objects chosen from n distinct objects without repetition.

• The formula is p(n, r) = n! / (n - r)!, which is the same as multiplying n choices, then n - 1, then n - 2, until you have r factors.

• Order matters in permutations, so ABC and BAC are different outcomes.

• If r = n, then p(n, n) = n!, and if r > n, the count is 0 because you cannot arrange more distinct items than you have.

• When a problem talks about ranking, lining up, or assigning positions, p(n, r) is usually the right count.

Frequently asked questions about p(n, r)

What is p(n, r) in Combinatorics?

p(n, r) is the number of permutations of n distinct objects taken r at a time without repetition. It counts ordered selections, so the order of the chosen items changes the outcome. The standard formula is n! / (n - r)!.

How is p(n, r) different from combinations?

p(n, r) counts order, while combinations do not. For example, choosing A and B as a pair is the same combination either way, but arranging A then B is different from B then A. If the problem cares about position, use permutations.

When do I use p(n, r) in a problem?

Use it when you are selecting distinct items and their order matters. Common clues are words like arrange, rank, line up, assign, or place in order. If repetition is allowed or order does not matter, the counting method changes.

What happens if r is bigger than n?

Then p(n, r) is 0, because you cannot arrange more distinct objects than you have available. That is one reason to check the wording carefully before plugging into the formula.