Study guide
8.3 Probability, Permutations & Combinations
PAF Aeronautical Engineering Route Skills Review Exam
Track your progress as you read
Finished sections get a check mark.
1 Route & Official-Source Overview
1.1 What Is Officially Published 1.2 Eligibility & Registration 1.3 Initial Assessment, ISSB & NUST CAE
2 Verbal Reasoning
2.1 Analogies & Classification 2.2 Coding, Series & Direction Sense 2.3 Verbal Logic, Percentages & Vocabulary
3 Non-Verbal Reasoning
3.1 Pattern & Figure Series 3.2 Odd-One-Out & Matrix Reasoning 3.3 Spatial Rotation, Classification & Symbol Substitution
4 English Language
4.1 Grammar, Tenses & Prepositions 4.2 Active/Passive Voice & Sentence Correction 4.3 Technical Vocabulary, Spelling & Comprehension
5 Mathematics: Algebra & Functions
5.1 Number Systems, Sets & Functions 5.2 Equations, Inequalities & Quadratics 5.3 Sequences, Series & Logarithms
6 Mathematics: Matrices & Trigonometry
6.1 Matrices & Determinants 6.2 Trigonometric Identities & Equations 6.3 Trigonometry Applications
7 Mathematics: Geometry & Vectors
7.1 Analytic Geometry: Straight Lines 7.2 Conic Sections Basics 7.3 Vectors
8 Mathematics: Calculus & Probability
8.1 Differentiation 8.2 Integration & Applications 8.3 Probability, Permutations & Combinations
9 Physics: Mechanics
9.1 Units, Measurements & Kinematics 9.2 Newton’s Laws, Energy & Momentum 9.3 Circular Motion, Gravitation & SHM
10 Physics: Fluids & Thermodynamics
10.1 Fluid Mechanics 10.2 Heat, Temperature & Gas Laws 10.3 Laws of Thermodynamics
11 Physics: Electricity & Magnetism
11.1 Electrostatics 11.2 Current Electricity & Circuits 11.3 Magnetism & Electromagnetic Induction
12 Physics: Waves & Optics
12.1 Waves & Sound 12.2 Ray Optics 12.3 Wave Optics
13 Modern Physics, Aeronautical Context & Study Strategy
13.1 Modern & Nuclear Physics 13.2 Aeronautical Physics Applications 13.3 Independent Study & Official-Source Strategy
8.3 Probability, Permutations & Combinations
Key Takeaways Explain This Topic AI
Classical probability: P(E) = n(E)/n(S) when outcomes are equally likely; 0 ≤ P(E) ≤ 1 and P(S) = 1.
Complement: P(E′) = 1 − P(E); addition: P(A ∪ B) = P(A) + P(B) − P(A ∩ B); independent events: P(A ∩ B) = P(A)P(B).
Permutations P(n, r) = n!/(n−r)! count ordered selections; combinations C(n, r) = n!/(r!(n−r)!) count unordered selections.
Use permutations when order/arrangement matters (codes, rankings); use combinations when only the set matters (committees, hands).
For counting problems, identify whether order matters before choosing P(n,r) or C(n,r).
Last updated: July 2026
Probability and Counting
FSc Pre-Engineering probability and combinatorics appear as rapid “how many ways” and “what is the probability” stems. The two skills share one core skill: count carefully , then divide favorable by total when outcomes are equally likely.
Classical Probability
If a sample space S has n(S) equally likely outcomes and event E has n(E) favorable outcomes, P ( E ) = n ( E ) n ( S ) . P(E) = \frac{n(E)}{n(S)}. P ( E ) = n ( S ) n ( E ) .
- Property Statement
- Bounds 0 ≤ P(E) ≤ 1
- Certainty P(S) = 1
- Impossibility P(∅) = 0
- Complement P(E′) = 1 − P(E)
- Addition P(A ∪ B) = P(A) + P(B) − P(A ∩ B)
- Mutually exclusive If A ∩ B = ∅, then P(A ∪ B) = P(A) + P(B)
- Independent P(A ∩ B) = P(A)P(B)
Worked die. Fair six-sided die: P(even) = 3/6 = 1/2 . P(not 6) = 1 − 1/6 = 5/6 .
Worked cards (no replacement thinking). From a standard 52-card deck, P(ace) = 4/52 = 1/13 . P(heart or ace) = P(heart) + P(ace) − P(ace of hearts) = 13/52 + 4/52 − 1/52 = 16/52 = 4/13 .
Worked independent events. Two fair coins: P(both heads) = (1/2)·(1/2) = 1/4 . Sample space {HH, HT, TH, TT} confirms one of four outcomes.
Conditional probability (light touch). P(A|B) = P(A ∩ B)/P(B) when P(B) > 0. If a die shows an even number, P(it is 2 | even) = (1/6)/(1/2) = 1/3 (favorable among {2,4,6}).
Worked bag without replacement. An urn holds 3 white and 2 black balls. Two balls are drawn in succession without replacement. P(first white and second black) = (3/5)·(2/4) = 3/10 . P(both white) = (3/5)·(2/4) = 3/10 as well—same arithmetic, different event. P(same color) = P(WW) + P(BB) = (3/5)(2/4) + (2/5)(1/4) = 6/20 + 2/20 = 8/20 = 2/5 .
Mutually exclusive vs independent (trap). Mutually exclusive events cannot both occur (A ∩ B = ∅), so for nontrivial events they are not independent. Independent events can both occur; their joint probability factors. If a stem says “cannot happen together,” use addition without the intersection term—do not multiply.
Factorials
n! = n·(n−1)·…·1, with 0! = 1 by convention. You need this for both permutations and combinations.
n n!
- 0 1
- 1 1
- 2 2
- 3 6
- 4 24
- 5 120
- 6 720
- Permutations: Order Matters
The number of ways to arrange r distinct objects chosen from n distinct objects is P ( n , r ) = n ! ( n − r ) ! = n ( n − 1 ) ⋯ ( n − r + 1 ) . P(n, r) = \frac{n!}{(n-r)!} = n(n-1)\cdots(n-r+1). P ( n , r ) = ( n − r )! n ! = n ( n − 1 ) ⋯ ( n − r + 1 ) .
Full arrangements of n distinct objects: P(n, n) = n!.
Worked permutations. How many 3-letter codes from {A,B,C,D,E} with no repetition? P(5, 3) = 5·4·3 = 60 .
Worked ranking. 8 cadets; how many ways to award gold, silver, bronze (distinct medals)? P(8, 3) = 8·7·6 = 336 .
With identical letters (arrangement formula). Distinct permutations of the letters in “PAF”: 3! = 6. For a word with repeated letters, divide by factorials of repeats—e.g. arrangements of “BOOK” = 4!/(2!) = 12 . Arrangements of “SUCCESS” = 7!/(3!·2!) = 420 (S three times, C twice).
Circular permutations (occasional). Distinct seats around a round table for n people: (n − 1)! (rotations counted as the same). For 5 officers at a round briefing table: 4! = 24 .
Combinations: Order Does Not Matter
The number of ways to choose r objects from n when order is irrelevant is C ( n , r ) = ( n r ) = n ! r ! ( n − r ) ! = P ( n , r ) r ! . C(n, r) = \binom{n}{r} = \frac{n!}{r!(n-r)!} = \frac{P(n,r)}{r!}. C ( n , r ) = ( r n ) = r ! ( n − r )! n ! = r ! P ( n , r ) .
Symmetry: C(n, r) = C(n, n − r). Pascal: C(n, r) = C(n−1, r−1) + C(n−1, r).
Worked combinations. Choose 3 subjects from 7 electives: C(7, 3) = 35. Same as C(7, 4) = 35 by symmetry.
Worked committee. From 5 pilots and 4 engineers, form a team of 3 pilots and 2 engineers: C(5, 3)·C(4, 2) = 10·6 = 60 .
Permutation vs Combination Decision Tree
Ask: Does rearranging the same people/objects create a new outcome?
- Yes (passwords, podium places, seating in a row) → permutation
- No (committee membership, lottery numbers as a set, choosing topics) → combination
Side-by-side. Selecting 2 officers from 5 for a patrol where roles are identical: C(5, 2) = 10 . Selecting a patrol leader and a deputy from 5: P(5, 2) = 20 .
Probability with Combinations
Worked hand probability. A box has 6 red and 4 blue bolts. Two bolts drawn at random without replacement. P(both red) = C(6, 2)/C(10, 2) = 15/45 = 1/3 . Sequentially: (6/10)·(5/9) = 30/90 = 1/3—same answer.
Worked mixed. P(one red and one blue) = [C(6,1)C(4,1)]/C(10,2) = 24/45 = 8/15 .
Binomial probability (quick bridge). If each independent trial has success probability p, then P(exactly k successes in n trials) = C(n, k) pᵏ (1−p)ⁿ⁻ᵏ. Example: fair coin, P(exactly 3 heads in 5 tosses) = C(5, 3)(1/2)⁵ = 10/32 = 5/16 . The C(n, k) factor is the same counting tool used in combinations.
- Situation Formula Numeric cue
- Ordered r-sample, no repeat P(n, r) codes, medals
- Unordered r-sample C(n, r) committees
- With replacement ordered nʳ PIN digits may repeat
- Classical probability n(E)/n(S) fair die/cards
- Independent intersection P(A)P(B) separate coins
Worked with-replacement contrast. 4-digit PINs using digits 0–9 allowing repeats: 10⁴ = 10000 . Without repeats: P(10, 4) = 10·9·8·7 = 5040 . Wrong options often swap these two.
Practice Focus
Expect: “P(n,r) = ?”, “C(n,r) = ?”, “probability both are …”, and “how many committees.” Compute small factorials by expanding products rather than writing n! fully. If stuck between 60 and 10 on a “choose 3 from 5” stem, re-read whether roles are distinct—that single word usually decides P vs C. Prefer complement counting when “at least one” appears: P(at least one) = 1 − P(none).