Cre8Learn Institute Permutations and Combinatorial Analysis Engineering and Technology Portal
Cre8Learn Institute

Permutations and Combinatorial Analysis

Written for Engineering and Technology students. Every formula is stated exactly, every worked example is short, and every method is tied to an engineering use case. Read one section at a time and attempt the quiz only after you finish the notes.

How to use this portal: Open Section 1 first. The whole topic rests on the Fundamental Counting Principle. If you understand that one idea, permutations and combinations become simple applications of it.
Section 1

The Fundamental Counting Principle

+

Statement of the Principle

If one operation can be performed in m ways and a second operation can be performed in n ways, then the two operations performed together can be performed in m × n ways. This is the multiplication rule for counting.

Engineering example: A printed circuit board has 8 different locations for a component. Four different component types can be placed in one location. Total design choices = 8 × 4 = 32

For r operations performed in sequence, with n1, n2, ..., nr outcomes respectively, the total number of outcomes is the product n1 × n2 × ... × nr.

License plate with 3 letters followed by 3 digits, repeats allowed: 26 × 26 × 26 × 10 × 10 × 10 = 17,576,000 Without repetition: 26 × 25 × 24 × 10 × 9 × 8 = 11,232,000
Why it works: Every outcome of the first operation combines with every outcome of the second, so the total list of combined outcomes is a rectangle of size m by n.

When to Use It

  • When operations happen one after another (sequential stages).
  • When each stage has a fixed number of independent choices.
  • When you are counting total arrangements, not selecting a subset.
Tip for engineers: Draw a tree diagram with one branch per stage. The number of leaves at the end of the tree is the answer.
Section 2

Factorial Notation

+

Definition

For a natural number n, the factorial n! is the product of all positive integers from 1 up to n.

n! = n × (n − 1) × (n − 2) × ... × 3 × 2 × 1 5! = 5 × 4 × 3 × 2 × 1 = 120 3! = 3 × 2 × 1 = 6 1! = 1

By convention, 0! = 1. This convention is required so that the permutation and combination formulas give correct answers in edge cases, for example when you choose all n objects from n objects.

Watch out: 0! is not 0. It is defined as 1 so that formulas remain consistent.

Useful Factorial Facts

  • n! = n × (n − 1)!
  • (n + 1)! = (n + 1) × n!
  • Factorials grow extremely fast. 10! is already 3,628,800.
Engineering note: In reliability and quality control, factorials appear when you count the number of orderings of failures or the number of test sequences.
Section 3

Permutations: Order Matters

+

Definition

A permutation is an ordered arrangement of objects. Order matters. The arrangement ABC is different from CBA.

The number of permutations of n distinct objects taken r at a time is written nPr.

nPr = n! / (n − r)! Example: Top 3 finishers in a race with 5 cars 5P3 = 5! / (5 − 3)! = 120 / 2 = 60 ABC is not the same as CAB.

When r = n, the number of permutations of all n objects is simply n!.

Permutations with Repetition Allowed

If you are forming an ordered sequence of length k from a set of n objects and repetition is allowed, each position has n choices independently.

Number of k-permutations with repetition = n^k Example: 3 letter words from a 26 letter alphabet, repetition allowed 26 × 26 × 26 = 26^3 = 17,576 Example: Binary strings of length k 2^k

Circular Permutations

When objects are arranged in a circle, rotations of the same arrangement are considered identical. For example, seating A, B, C in a circle gives only 2 distinct arrangements, not 3! = 6, because rotating the circle does not create a new arrangement.

Number of circular permutations of n distinct objects = (n − 1)! Example: 5 people seated around a round table (5 − 1)! = 4! = 24
Why: Fix one person as the reference point. The remaining n − 1 people can be arranged in (n − 1)! ways relative to that reference.

Permutations with Identical Items

When some objects are identical, dividing by the factorials of the repeated items removes the overcounting.

Number of distinct permutations of n objects with groups of identical items = n! / (n1! × n2! × ... × nr!) Example: Distinct arrangements of the letters of MISSISSIPPI Total letters = 11 M appears 1 time, I appears 4 times, S appears 4 times, P appears 2 times 11! / (1! × 4! × 4! × 2!) = 34,650
Section 4

Combinations: Order Does Not Matter

+

Definition

A combination is a selection of objects where order does not matter. Selecting A, B, C is the same as selecting C, B, A.

The number of combinations of n distinct objects taken r at a time is written nCr or C(n, r).

nCr = nPr / r! = n! / (r! × (n − r)!) Example: Choose a subcommittee of 4 from 10 engineers 10C4 = 10! / (4! × 6!) = 210

The relationship between permutations and combinations is exact: every combination of r objects can be arranged internally in r! ways. Therefore nPr = nCr × r!.

Engineering example: A reliability test selects 3 components from a batch of 20. The order of selection does not affect which batch is tested, so this is a combination, not a permutation. 20C3 = 1140.

Key Properties of Combinations

  • Symmetry: nCr = nC(n − r). Choosing 3 from 10 is the same count as choosing 7 from 10.
  • Endpoints: nC0 = 1 and nCn = 1.
  • Pascal's identity: nCr + nC(r − 1) = (n + 1)Cr. This generates Pascal's triangle.
  • Total subsets: The sum of all combinations nC0 + nC1 + ... + nCn = 2^n.
Check symmetry: 10C3 = 120 10C7 = 120 Both are equal, as expected.

Combinations with Repetition Allowed

If you choose r items from n types and repetition is allowed, and order does not matter, the count is:

(n + r − 1)Cr = (n + r − 1)! / (r! × (n − 1)!) Example: Choose 3 cables from 5 cable types, repetition allowed (5 + 3 − 1)C3 = 7C3 = 35
Section 5

Binomial Coefficients and the Binomial Theorem

+

Binomial Coefficients

The combination nCr is also called the binomial coefficient, written (n over r) in some texts. It counts the number of ways to choose r successes in n trials.

(n over r) = nCr = n! / (r! × (n − r)!)

The Binomial Theorem

(a + b)^n = Σ from r = 0 to n of [ nCr × a^(n − r) × b^r ] Example: (a + b)^4 = a^4 + 4a^3 b + 6a^2 b^2 + 4ab^3 + b^4 Coefficients: 1, 4, 6, 4, 1

The coefficients of the expansion are exactly the combinations nC0, nC1, ..., nCn, and they form the rows of Pascal's triangle.

Engineering application: In structural mechanics, the binomial expansion is used to compute coefficients in beam deflection and plate bending problems. In reliability engineering, it counts the number of ways exactly k components out of n can fail.
Section 6

Engineering Applications

+

Circuit Board Layout

A printed circuit board has 8 different locations where a component can be placed. If four distinct component types are available, the number of ways to assign a component to a location, with no location repeated, is a permutation.

8P4 = 8! / 4! = 1680

Quality Control and Reliability

A batch of 50 components contains 5 defective units. A quality engineer draws a sample of 10. The number of possible samples is a combination because the order of drawing does not matter.

50C10 = 10,272,278,170

If the engineer wants to know how many samples contain exactly 2 defective units, the count is the product of two combinations:

5C2 × 45C8

Network and Communication Systems

In a network with 12 nodes, the number of possible point to point links is the number of pairs of nodes.

12C2 = 66 links

If the links are directional (one way connections), the count becomes a permutation: 12P2 = 132.

Manufacturing and Production Sequences

A machine must process 6 different jobs. The number of possible processing orders is 6! = 720. If two jobs are identical and the rest are distinct, divide by 2! to remove overcounting.

6! / 2! = 360 distinct schedules
Section 7

Common Mistakes to Avoid

+

Using a Permutation When the Order Does Not Matter

If you are choosing a committee, a sample, or a set of components where the final group is what matters, use a combination. If you are ranking, scheduling, or assigning to labelled positions, use a permutation.

Forgetting to Divide by Repeated Factorials

When identical items are present, always divide by the factorial of each repeated group. Otherwise you will overcount.

Forgetting the Circular Adjustment

For seating around a round table, use (n − 1)!, not n!. Rotations are the same arrangement.

Treating 0! as 0

0! = 1. This is essential for the combination formula when r = 0 or r = n.

Adding Instead of Multiplying in Multi Stage Problems

When stages are sequential, multiply the choices. Add only when you are counting mutually exclusive alternatives.

Section 8

Sources and Further Reading

+

Reputable References Used for This Portal

  • LibreTexts Mathematics, Permutations and Combinations, Calculus for Engineering Technology. math.libretexts.org
  • MIT OpenCourseWare, Lecture 4: Counting, Probabilistic Systems Analysis and Applied Probability, Electrical Engineering and Computer Science. ocw.mit.edu
  • University of Illinois at Urbana Champaign, ECE 307, Review of Combinatorial Analysis, Department of Electrical and Computer Engineering.
  • eCampusOntario, Permutations, Circular Permutations and Permutations with Similar Elements, Mathematics for Public and Occupational Health Professionals.
  • Springer Texts in Statistics, Carlton and Devore, Probability with Applications in Engineering, Science and Technology, Second Edition, counting and permutation chapters.
Cre8Learn Institute

Permutations and Combinatorial Analysis: Quiz Bank

41 questions covering the counting principle, factorials, permutations, circular permutations, combinations, binomial coefficients, and engineering applications. Answer at your own pace, then check your score.

Cre8Learn Institute · Permutations and Combinatorial Analysis · Engineering and Technology · 2026