We have seen how to calculate the number of arrangements when the order matters (permutation) and when all the objects are taken at a time, possibly with or without repetition. In this page, we extend our knowledge of permutations to include some other cases.

Permutations of n Objects Taken k at a Time

How do we adapt our formula n! if we do not take all the objects? Simply put, if we take k objects, we divide n! by (n-k)! as this is the number of ways the remaining objects could be arranged.

Claim (Partial Permutations / Subset Arrangements): Let n and k be non-negative integers such that 0 \le k \le n. The total number of unique ways to select k objects from a pool of n distinct objects and arrange them into a linear sequence without repetition is denoted by P(n, k) or ^{n}P_{k}, and is given by the formula:

    \[P(n, k) = \frac{n!}{(n-k)!}\]

Examples of this can be creating groups/committees, awarding prizes, and so on.

Example: A competitive math club has 10 distinct members. The club needs to select and elect a President, a Vice-President, and a Treasurer for the upcoming academic year. If no member can hold more than one position concurrently, in how many unique ways can these three leadership roles be filled?

Example: A photography exhibition has space to hang exactly 4 paintings side-by-side in a straight row on its main feature wall. If an artist submits a collection of 8 completely distinct paintings, in how many unique ways can the gallery curator select and arrange the paintings to fill the available wall slots?

Conditions and Complements

The basic principle we use in this section is the following: The number of arrangements that satisfy (CONDITION) is equal to the number of total arrangements minus the number of arrangements that do not satisfy (CONDITION).

Simply put, sometimes it is easier to look at the complement of a condition. To conclude our number, we can simply subtract this complement from the total.

Example: A, B, C, D, E, and F are students. In how many ways can they be seated in a row if:

  • there are no restrictions on the seating.
  • A and B must sit together.
  • A and B must not sit beside one another.
  • D, E, and F must sit together.
  • A and F must sit at each end of the row.

Notice the trick we used here to combine people into one object. If we want to ensure that 2 people sit together, we can treat them as one. Then, we multiply the number of arrangements by 2! because that is the number of ways we can rearrange the two people we combined. The same logic applies with 3 people and 3! and so on.

Example: A family of six people, composed of 3 children (K_1, K_2, K_3), 2 parents (P_1, P_2), and 1 grandparent (G), purchases a row of six consecutive seats at a cinema. In how many unique ways can they be seated if:

  • there are no restrictions on the seating arrangement.
  • the 2 parents must sit immediately next to each other.
  • the 2 parents must not sit beside one another.
  • all 3 children must sit together in an unbroken block.
  • the 2 parents must occupy the seats on the outer ends of the row.

Exercise

How many different four-digit numbers greater than 6,000 can be formed using the digits 1, 2, 4, 5, 6, and 7 if:

a.
No digit is repeated.
b.
Repetitions are allowed?

Solve each of the following eight independent arrangement scenarios by applying the appropriate permutation principles (distinct linear permutations, partial subset permutations, multiset repetition rules, or positional slot constraints). State each final answer as an exact integer value.

(a)
A software team of 5 front-end developers and 3 back-end engineers lines up side-by-side for a group photo. How many unique linear arrangements can be formed if all 3 back-end engineers must stand together in an unbroken block?
(b)
A local chess club has 12 elite members. In how many unique ways can the club select and elect an ordered list of 3 members to fill three distinct, uniquely titled roles: Club Champion, Team Captain, and Event Coordinator? (No member can hold more than one role).
(c)
A custom manufacturing facility tags items using a 6-character serial string. Each individual slot can be filled by any of the 10 single-digit numbers (0–9) or any of the 26 uppercase letters (A–Z). If full character repetition is allowed across all slots, how many unique serial strings can be generated?
(d)
A graphic design studio is building a linear color-block pattern. How many unique horizontal arrangements can be made by placing 3 identical red flags, 4 identical blue flags, and 2 identical green flags side-by-side in a straight row?
(e)
How many unique five-letter words can be created by arranging the distinct letters V, W, X, Y, and Z exactly once such that the letter V must always fill the first position, and the letter W can never be placed in the last position?
(f)
A security lock requires a unique 4-digit code built by rearranging the distinct digits 2, 3, 5, and 8 exactly once without repetition. How many unique codes can be formed if the final digit of the code must be an even number?
(g)
Determine the total number of unique nine-letter words that can be created by rearranging all of the individual letters from the word TENNESSEE.
(h)
A radio station is scheduling a morning broadcast block consisting of 5 distinct songs. The station manager must select and order exactly 3 rock tracks from an available catalog of 7 distinct rock songs, followed immediately by exactly 2 pop tracks from an available catalog of 5 distinct pop songs. How many unique ordered broadcast sequences can be programmed?

How many different five-digit numbers can be formed from the digits 1, 2, 3, 4, and 5 if:

a.
There are no restrictions on digits and repetitions are allowed.
b.
The number is odd and no repetitions are allowed.
c.
The number is even and repetitions are allowed.
d.
The number is greater than 5,000 and no repetitions are allowed?

A group of seven students, P, Q, R, S, T, U, and V, are being seated in a single straight row of seven chairs. For each of the following independent scenarios, determine the exact number of unique seating arrangements that can be formed. Simplify your answers to final integer values.

(a)
There are no restrictions on the seating arrangement.
(b)
Students P and Q must sit immediately next to each other.
(c)
Students P and Q must not sit beside one another.
(d)
Students R, S, and T must sit together in an unbroken block.
(e)
Students U and V must occupy the two seats at each end of the row.

A modern design firm is setting up a row of eight individual, side-by-side workstation desks for a new creative team. The team consists of 8 distinct professionals: 4 graphic designers (G_1, G_2, G_3, G_4), 2 copywriters (C_1, C_2), and 2 account managers (M_1, M_2). Evaluate each of the following independent setup scenarios, providing your final answers as exact integer counts.

(a)
There are absolutely no restrictions on how the 8 professionals are assigned to the 8 row desks.
(b)
The 2 copywriters (C_1 and C_2) must be assigned to desks that are immediately adjacent to one another.
(c)
The 2 copywriters (C_1 and C_2) must not be assigned to adjacent desks.
(d)
All 4 graphic designers must have their desks grouped together in a single, unbroken block of 4 desks.
(e)
The 2 account managers (M_1 and M_2) must occupy the desks on the outer ends of the row (one at the far left, and one at the far right).
error: Content is protected!