Study guide
16.1 Fundamental Counting Principle, Permutations & Combinations
FTCE Mathematics 6-12 026
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview & Rational Number Systems
1.1 FTCE Mathematics 6-12 Overview, Interface & Test-Taking Strategies 1.2 Rational Numbers, Representations & Multi-Step Operations
2 Chapter 2: Real Number Approximations & Proportional Reasoning
2.1 Irrational Numbers, Radical Estimation & Scientific Notation 2.2 Ratios, Rates, Proportions & Dimensional Analysis 2.3 Percent Applications, Financial Models & Depreciation
3 Chapter 3: Algebraic Expressions & Polynomial Operations
3.1 Polynomial Arithmetic, Factoring Strategies & Special Products 3.2 Radical Operations, Rational Expressions & Equations 3.3 Field Properties, Exponent Laws & Literal Equations
4 Chapter 4: Linear Relationships, Systems & Inequalities
4.1 Linear Equations, Slope Concepts & Line Forms 4.2 Systems of Linear Equations & Real-World Applications 4.3 Single & Systems of Linear Inequalities on the Coordinate Plane 4.4 Absolute Value Equations & Inequalities in One and Two Variables
5 Chapter 5: Quadratic Equations, Functions & Complex Numbers
5.1 Quadratic Equations, Discriminant & Complex Number Arithmetic 5.2 Quadratic Functions: Vertex, Axis, Intercepts & Concavity 5.3 Quadratic Inequalities in One/Two Variables & Optimization
6 Chapter 6: Function Foundations, Transformations & Inverses
6.1 Function Definitions, Relations, Domain, Range & Notation 6.2 Function Families, Key Graphical Behaviors & Even/Odd Symmetry 6.3 Shifting, Scaling & Reflecting Functions Across Representations 6.4 Function Composition, Invertibility & Inverse Functions
7 Chapter 7: Geometric Foundations, Angles & Deductive Proofs
7.1 Angle Relationships, Parallel Lines & Transversals 7.2 Triangle Sum, Exterior Angles & Polygon Angle Formulas 7.3 Formal Proof Methods, CPCTC & Quadrilateral Properties
8 Chapter 8: Congruence, Similarity & Geometric Transformations
8.1 Triangle Congruence (SSS, SAS, ASA, AAS, HL) & Similarity (AA, SAS, SSS) 8.2 Rigid Motions: Translations, Reflections, Rotations & Symmetry 8.3 Dilations, Scale Factors & Proportional Reasoning in Geometry
9 Chapter 9: Coordinate Geometry & 3D Spatial Measurement
9.1 Distance, Midpoint, Slope Criteria & Coordinate Proofs 9.2 Perimeter, Area, Surface Area & Volume of 2D and 3D Figures 9.3 Cross Sections of 3D Figures & Solids of Revolution
10 Chapter 10: Circle Theorems & Geometric Constructions
10.1 Central, Inscribed, Tangent & Chord Angles and Arcs 10.2 Intersecting Chords, Secant/Tangent Lengths, Arc Length & Sector Area 10.3 Euclidean Constructions with Compass and Straightedge
11 Chapter 11: Conic Sections & Coordinate Modeling
11.1 Circles and Parabolas: Geometric Definitions, Equations & Modeling 11.2 Ellipses and Hyperbolas: Foci, Axes, Asymptotes & Real-World Applications
12 Chapter 12: Trigonometric Foundations & Oblique Triangles
12.1 Right-Triangle Trigonometry, Pythagorean Theorem & Special Triangles 12.2 The Unit Circle, Radian Measure & Exact Trigonometric Values 12.3 Law of Sines (Ambiguous Case), Law of Cosines & Oblique Triangle Area
13 Chapter 13: Trigonometric Functions, Polar & Parametric Systems
13.1 Graphs of the Six Trigonometric Functions & Periodic Modeling 13.2 Polar Coordinates, Polar-Rectangular Conversion & Polar Graphs 13.3 Parametric Equations, Elimination of Parameters & Projectile Motion
14 Chapter 14: Descriptive Statistics & Data Distributions
14.1 Measures of Central Tendency, Dispersion & Resistant Statistics 14.2 Univariate Displays (Histograms, Boxplots, Stemplots) & Distribution Shapes 14.3 Normal Distribution Properties, Empirical Rule & Standard Normal Z-Scores
15 Chapter 15: Statistical Studies, Bivariate Data & Linear Regression
15.1 Statistical Study Design, Random Sampling Techniques & Sources of Bias 15.2 Survey Sampling, Margin of Error & Population Estimation 15.3 Scatterplots, Correlation Coefficient r, Linear Regression & Residuals
16 Chapter 16: Probability Theory, Two-Way Tables & Expected Value
16.1 Fundamental Counting Principle, Permutations & Combinations 16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability 16.3 Two-Way Frequency Tables, Law of Large Numbers & Expected Value of Random Variables
17 Chapter 17: Precalculus: Polynomial, Rational & Transcendental Functions
17.1 Fundamental Theorem of Algebra, Remainder/Factor Theorems & Polynomial Roots 17.2 Rational Functions, Domain Restrictions, Holes & Asymptotes 17.3 Exponential & Logarithmic Functions, Base e & Logarithmic Properties
18 Chapter 18: Sequences, Series, Binomial Theorem & Vectors
18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence 18.2 Binomial Theorem, Pascal's Triangle & General Term Determination 18.3 Vector Representations, Operations, Magnitude, Direction & Dot Product
19 Chapter 19: Differential Calculus Foundations
19.1 Limits, One-Sided Limits, Indeterminate Forms & Continuity 19.2 Derivative Definition, Power, Product, Quotient & Transcendental Rules 19.3 Chain Rule, Tangent Line Equations & Rates of Change
20 Chapter 20: Applications of Derivatives & Integral Calculus
20.1 First & Second Derivative Tests, Extrema, Concavity & Optimization 20.2 Antiderivatives, Indefinite Integrals & Integration by U-Substitution 20.3 Fundamental Theorem of Calculus, Net Signed Area & Geometric Applications
21 Chapter 21: Mathematical Representations, Progressions & Tools
21.1 Concrete-Representational-Abstract (CPA) Progressions & Concept Continuity 21.2 The Rule of Four: Translating Among Representations to Support Fluency 21.3 Manipulatives, Dynamic Software & Technology in Secondary Mathematics
22 Chapter 22: Assessment, Error Analysis & Misconception Remediation
22.1 Student Misconceptions & Error Analysis Across Core Secondary Domains 22.2 Evaluating Validity of Student Mathematical Arguments & Reasonableness Checks 22.3 Formative Assessment Formats, Data-Driven Differentiation & Tiered Tasks
16.1 Fundamental Counting Principle, Permutations & Combinations
Key Takeaways Explain This Topic AI
The Fundamental Counting Principle states that if an experiment involves k k k sequential stages with n 1 , n 2 , … , n k n_1, n_2, \dots, n_k n 1 , n 2 , … , n k independent outcomes, the total number of distinct compound outcomes is the product n 1 ⋅ n 2 … n k n_1 \cdot n_2 \dots n_k n 1 ⋅ n 2 … n k .
Permutations quantify ordered arrangements where position matters ( n P r = n ! ( n − r ) ! nPr = \frac{n!}{(n - r)!} n P r = ( n − r )! n ! ), with specialized quotient formulas for indistinguishable items (multiset permutations n ! n 1 ! n 2 ! … n k ! \frac{n!}{n_1! n_2! \dots n_k!} n 1 ! n 2 ! … n k ! n ! ) and circular arrangements ( ( n − 1 ) ! (n - 1)! ( n − 1 )! or ( n − 1 ) ! 2 \frac{(n - 1)!}{2} 2 ( n − 1 )! with reflection).
Combinations quantify unordered subsets ( n C r = ( n r ) = n ! r ! ( n − r ) ! nCr = \binom{n}{r} = \frac{n!}{r!(n - r)!} n C r = ( r n ) = r ! ( n − r )! n ! ), related to permutations by the fundamental algebraic bridge n P r = r ! ⋅ n C r nPr = r! \cdot nCr n P r = r ! ⋅ n C r .
Binomial coefficients exhibit intrinsic reflective symmetry ( n r ) = ( n n − r ) \binom{n}{r} = \binom{n}{n - r} ( r n ) = ( n − r n ) , satisfy Pascal's recurrence identity ( n r ) + ( n r − 1 ) = ( n + 1 r ) \binom{n}{r} + \binom{n}{r - 1} = \binom{n + 1}{r} ( r n ) + ( r − 1 n ) = ( r n + 1 ) , and sum across rows to generate the total power set cardinality ∑ r = 0 n ( n r ) = 2 n \sum_{r=0}^n \binom{n}{r} = 2^n ∑ r = 0 n ( r n ) = 2 n .
Constrained group selections partition composite outcomes into mutually exclusive stages combined by the multiplication principle, while scenarios involving 'at least' or 'at most' conditions are efficiently solved using direct addition or complementary counting.
Last updated: September 2026
- 16.1 Fundamental Counting Principle, Permutations & Combinations
- The Fundamental Counting Principle & Factorial Operations
Combinatorics provides the structural mathematical foundation for discrete probability theory. Calculating the probability of an event requires determining the exact cardinality of favorable outcomes relative to the total cardinality of the sample space. Enumerating outcomes one by one is impractical for complex systems, necessitating rigorous algebraic counting principles.
The foundational bedrock of enumerative combinatorics is the Fundamental Counting Principle (Multiplication Rule of Counting) : If a composite procedure can be partitioned into a sequence of k k k independent operational stages, where Stage 1 produces n 1 n_1 n 1 possible outcomes, Stage 2 produces n 2 n_2 n 2 possible outcomes regardless of the outcome of Stage 1, and so on through Stage k k k producing n k n_k n k possible outcomes, then the total number of distinct sequence outcomes is the product: N = n 1 × n 2 × n 3 × ⋯ × n k = ∏ i = 1 k n i N = n_1 \times n_2 \times n_3 \times \dots \times n_k = \prod_{i=1}^k n_i N = n 1 × n 2 × n 3 × ⋯ × n k = i = 1 ∏ k n i
When a counting procedure requires sequential selections without replacement from a finite set of n n n distinct objects, the multiplication rule naturally generates the factorial function . For any non-negative integer n n n , the factorial n ! n! n ! (read ' n n n factorial') represents the product of all positive integers less than or equal to n n n : n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 3 × 2 × 1 n! = n \times (n - 1) \times (n - 2) \times \dots \times 3 \times 2 \times 1 n ! = n × ( n − 1 ) × ( n − 2 ) × ⋯ × 3 × 2 × 1
with the baseline definition that 1 ! = 1 1! = 1 1 ! = 1 .
A crucial algebraic convention tested on the FTCE Mathematics 6-12 examination is the definition of zero factorial : 0 ! = 1 0! = 1 0 ! = 1 . This is not an arbitrary assignment; it is an algebraic requirement dictated by the recurrence relation governing all factorials: n ! = n × ( n − 1 ) ! ⟹ ( n − 1 ) ! = n ! n n! = n \times (n - 1)! \implies (n - 1)! = \frac{n!}{n} n ! = n × ( n − 1 )! ⟹ ( n − 1 )! = n n !
Evaluating this identity at n = 1 n = 1 n = 1 forces the definition: 0 ! = ( 1 − 1 ) ! = 1 ! 1 = 1 1 = 1 0! = (1 - 1)! = \frac{1!}{1} = \frac{1}{1} = 1 0 ! = ( 1 − 1 )! = 1 1 ! = 1 1 = 1
Combinatorially, 0 ! = 1 0! = 1 0 ! = 1 corresponds to the fact that there is exactly one way to arrange an empty set of zero objects (the empty arrangement).
Linear Permutations: When Order Matters
A permutation is an ordered arrangement of elements selected from a finite set without replacement. The defining diagnostic criterion of a permutation is that order matters : altering the sequential position of any element yields a distinct, unique outcome. For example, selecting a President, Vice President, and Secretary produces an ordered sequence ( A , B , C ) ≠ ( B , A , C ) (A, B, C) \ne (B, A, C) ( A , B , C ) = ( B , A , C ) , even though both groups contain identical individuals.
To derive the formula for the number of permutations of n n n distinct objects taken r r r at a time (denoted n P r nPr n P r or P ( n , r ) P(n, r) P ( n , r ) , with 0 ≤ r ≤ n 0 \le r \le n 0 ≤ r ≤ n ), we apply the Fundamental Counting Principle across r r r consecutive positions:
Position 1 can be filled by any of the n n n available objects.
Position 2 can be filled by any of the remaining n − 1 n - 1 n − 1 objects.
Position r r r can be filled by any of the remaining n − ( r − 1 ) = n − r + 1 n - (r - 1) = n - r + 1 n − ( r − 1 ) = n − r + 1 objects.
Multiplying these consecutive choices gives: n P r = n ( n − 1 ) ( n − 2 ) … ( n − r + 1 ) nPr = n(n - 1)(n - 2) \dots (n - r + 1) n P r = n ( n − 1 ) ( n − 2 ) … ( n − r + 1 )
To express this product compactly using factorials, we multiply and divide by ( n − r ) ! (n - r)! ( n − r )! : n P r = n ( n − 1 ) ( n − 2 ) … ( n − r + 1 ) × ( n − r ) ! ( n − r ) ! = n ! ( n − r ) ! nPr = \frac{n(n - 1)(n - 2) \dots (n - r + 1) \times (n - r)!}{(n - r)!} = \frac{n!}{(n - r)!} n P r = ( n − r )! n ( n − 1 ) ( n − 2 ) … ( n − r + 1 ) × ( n − r )! = ( n − r )! n !
Two critical boundary cases follow directly from this formula:
Arranging all n n n objects in a linear sequence ( r = n r = n r = n ): n P n = n ! ( n − n ) ! = n ! 0 ! = n ! 1 = n ! nPn = \frac{n!}{(n - n)!} = \frac{n!}{0!} = \frac{n!}{1} = n! n P n = ( n − n )! n ! = 0 ! n ! = 1 n ! = n !
Arranging zero objects from a set of n n n ( r = 0 r = 0 r = 0 ): n P 0 = n ! ( n − 0 ) ! = n ! n ! = 1 nP0 = \frac{n!}{(n - 0)!} = \frac{n!}{n!} = 1 n P 0 = ( n − 0 )! n ! = n ! n ! = 1
Multiset and Circular Permutations
Standard linear permutations assume all n n n objects are unique and distinguishable. When items repeat or geometric symmetry exists, standard formulas overcount distinct physical outcomes.
Multiset Permutations (Identical / Indistinguishable Objects)
When arranging n n n total objects where some objects are identical to one another, exchanging the positions of identical items does not generate a new physical arrangement. If a set contains n n n objects consisting of k k k distinct types, with n 1 n_1 n 1 identical objects of type 1, n 2 n_2 n 2 of type 2, and so on up to n k n_k n k of type k k k (such that ∑ i = 1 k n i = n \sum_{i=1}^k n_i = n ∑ i = 1 k n i = n ), the number of distinct permutations is: Distinguishable Permutations = n ! n 1 ! × n 2 ! × ⋯ × n k ! \text{Distinguishable Permutations} = \frac{n!}{n_1! \times n_2! \times \dots \times n_k!} Distinguishable Permutations = n 1 ! × n 2 ! × ⋯ × n k ! n !
The denominator eliminates redundant permutations: because the n 1 n_1 n 1 identical items can be internally reordered in n 1 ! n_1! n 1 ! ways without altering the arrangement, dividing by n 1 ! n_1! n 1 ! corrects the overcount.
Circular Permutations
When n n n distinct objects are arranged in a closed circle rather than a line, sequential positions have no absolute beginning or end. Shifting every object by one position clockwise preserves relative order, meaning that n n n distinct linear sequences correspond to a single circular arrangement. To break rotational symmetry, we fix one arbitrary object in place to serve as the reference point, and then arrange the remaining n − 1 n - 1 n − 1 objects in the remaining positions: Circular Permutations = n ! n = ( n − 1 ) ! \text{Circular Permutations} = \frac{n!}{n} = (n - 1)! Circular Permutations = n n ! = ( n − 1 )!
If the circular arrangement can be flipped over in three-dimensional space—such as keys on a key ring or beads on an unclasped necklace—clockwise and counter-clockwise orientations become physically indistinguishable. This reflectional symmetry divides the count by 2: Circular Permutations with Reflection = ( n − 1 ) ! 2 \text{Circular Permutations with Reflection} = \frac{(n - 1)!}{2} Circular Permutations with Reflection = 2 ( n − 1 )!
Combinations: When Order Does Not Matter
A combination is an unordered collection or subset of r r r objects selected from a set of n n n distinct objects without replacement (denoted n C r nCr n C r , C ( n , r ) C(n, r) C ( n , r ) , or ( n r ) \binom{n}{r} ( r n ) , with 0 ≤ r ≤ n 0 \le r \le n 0 ≤ r ≤ n ). The essential criterion is that order does not matter : the subset { A , B , C } \{A, B, C\} { A , B , C } is identical to { C , B , A } \{C, B, A\} { C , B , A } .
The Algebraic Bridge Between Permutations and Combinations
Every unordered combination of r r r elements can be arranged internally into r ! r! r ! distinct linear orders. By the Fundamental Counting Principle, the total number of ordered permutations n P r nPr n P r equals the number of unordered combinations n C r nCr n C r multiplied by the number of internal orderings r ! r! r ! : n P r = r ! × n C r nPr = r! \times nCr n P r = r ! × n C r
Solving for n C r nCr n C r yields the combination formula: n C r = ( n r ) = n P r r ! = n ! r ! ( n − r ) ! nCr = \binom{n}{r} = \frac{nPr}{r!} = \frac{n!}{r!(n - r)!} n C r = ( r n ) = r ! n P r = r ! ( n − r )! n !
Algebraic Symmetry and Pascal's Triangle Connections
Combinations satisfy structural algebraic properties vital for advanced problem-solving:
Reflective Symmetry: ( n r ) = ( n n − r ) \binom{n}{r} = \binom{n}{n - r} ( r n ) = ( n − r n ) Choosing r r r elements to include in a subset from n n n available items is mathematically identical to choosing the remaining n − r n - r n − r elements to exclude from the subset. For example, ( 100 98 ) = ( 100 2 ) = 100 × 99 2 = 4 , 950 \binom{100}{98} = \binom{100}{2} = \frac{100 \times 99}{2} = 4,950 ( 98 100 ) = ( 2 100 ) = 2 100 × 99 = 4 , 950 .
Pascal's Recurrence Identity: ( n r ) + ( n r − 1 ) = ( n + 1 r ) \binom{n}{r} + \binom{n}{r - 1} = \binom{n + 1}{r} ( r n ) + ( r − 1 n ) = ( r n + 1 ) This identity governs the construction of Pascal's Triangle , where every interior entry is the sum of the two entries directly above it. Combinatorially, consider selecting a committee of r r r individuals from a group of n + 1 n + 1 n + 1 people that includes a distinguished person X X X . The selections can be partitioned into two disjoint subsets: committees that exclude person X X X (which requires choosing all r r r members from the other n n n people, ( n r ) \binom{n}{r} ( r n ) ) and committees that include person X X X (which requires choosing the remaining r − 1 r - 1 r − 1 members from the other n n n people, ( n r − 1 ) \binom{n}{r - 1} ( r − 1 n ) ).
Sum of Row Entries (Power Set Summation): ∑ r = 0 n ( n r ) = ( n 0 ) + ( n 1 ) + ⋯ + ( n n ) = 2 n \sum_{r=0}^n \binom{n}{r} = \binom{n}{0} + \binom{n}{1} + \dots + \binom{n}{n} = 2^n r = 0 ∑ n ( r n ) = ( 0 n ) + ( 1 n ) + ⋯ + ( n n ) = 2 n Setting x = 1 x = 1 x = 1 and y = 1 y = 1 y = 1 in the Binomial Theorem ( x + y ) n = ∑ r = 0 n ( n r ) x n − r y r (x + y)^n = \sum_{r=0}^n \binom{n}{r} x^{n - r} y^r ( x + y ) n = ∑ r = 0 n ( r n ) x n − r y r proves that the total number of all possible subsets (the cardinality of the power set) of an n n n -element set is exactly 2 n 2^n 2 n .
Constrained Group Selections and Multi-Stage Groupings
Standard examination problems frequently impose structural constraints on group selection, such as selecting representatives from distinct sub-populations or requiring minimum representation ('at least one').
When forming a multi-category group (e.g., choosing teachers and students), the selection process divides into independent stages combined via the Fundamental Counting Principle: Total Ways = ( n 1 r 1 ) × ( n 2 r 2 ) × ⋯ × ( n k r k ) \text{Total Ways} = \binom{n_1}{r_1} \times \binom{n_2}{r_2} \times \dots \times \binom{n_k}{r_k} Total Ways = ( r 1 n 1 ) × ( r 2 n 2 ) × ⋯ × ( r k n k )
When constraints specify 'at least k k k ' or 'at most k k k ' members of a particular category, two analytical strategies are available:
Direct Partitioning (Addition Rule): Deconstruct the problem into mutually exclusive sub-cases and sum the individual combinatorial counts.
Complementary Counting: When favorable cases outnumber unfavorable cases, subtract the unfavorable outcomes from the total unconstrained outcomes: Favorable Outcomes = Total Unconstrained Outcomes − Unfavorable Outcomes \text{Favorable Outcomes} = \text{Total Unconstrained Outcomes} - \text{Unfavorable Outcomes} Favorable Outcomes = Total Unconstrained Outcomes − Unfavorable Outcomes This is especially powerful for 'at least one' conditions: Ways with ≥ 1 = Total Ways − Ways with 0 \text{Ways with } \ge 1 = \text{Total Ways} - \text{Ways with } 0 Ways with ≥ 1 = Total Ways − Ways with 0 .
Permutations vs. Combinations Comparison Matrix
Combinatorial Concept Order Significance Governing Formula Key Algebraic Identity Standard Real-World Applications
Linear Permutation Order strictly matters n P r = n ! ( n − r ) ! nPr = \frac{n!}{(n - r)!} n P r = ( n − r )! n ! n P n = n ! , n P 0 = 1 nPn = n!, \quad nP0 = 1 n P n = n ! , n P 0 = 1 Electing ranked officers (President, VP); race finishing orders; code sequences
Multiset Permutation Order matters; items repeat n ! n 1 ! n 2 ! … n k ! \frac{n!}{n_1! n_2! \dots n_k!} n 1 ! n 2 ! … n k ! n ! ∑ n i = n \sum n_i = n ∑ n i = n Word anagrams with repeated letters; scheduling identical tasks
Circular Permutation Relative circular position ( n − 1 ) ! (n - 1)! ( n − 1 )! ( n − 1 ) ! 2 \frac{(n - 1)!}{2} 2 ( n − 1 )! (with flip symmetry) Seating arrangements at a round table; molecular rings; keychains and necklaces
Combination Order does NOT matter n C r = ( n r ) = n ! r ! ( n − r ) ! nCr = \binom{n}{r} = \frac{n!}{r!(n - r)!} n C r = ( r n ) = r ! ( n − r )! n ! ( n r ) = ( n n − r ) \binom{n}{r} = \binom{n}{n - r} ( r n ) = ( n − r n ) Selecting committees; dealing card hands; lottery drawings; team rosters
Multi-Stage Subgroups Order within groups irrelevant ∏ i = 1 k ( n i r i ) \prod_{i=1}^k \binom{n_i}{r_i} ∏ i = 1 k ( r i n i ) Product of independent stages Forming balanced task forces with fixed quotas from departments
Worked Exemplar: Committee Selection with Sub-Constraints
Problem: A high school governance council must form a 5-member curriculum committee. The committee is selected from a candidate pool of 8 teachers and 6 students. The district policy requires that the committee must contain at least 3 teachers . In how many distinct ways can this committee be formed?
Solution Strategy
The selection requires choosing 5 individuals from a total pool of 8 + 6 = 14 8 + 6 = 14 8 + 6 = 14 candidates. Because member roles are unranked, order does not matter; this is a combination problem. The constraint 'at least 3 teachers' means the committee can contain 3, 4, or 5 teachers.
Method 1: Direct Partitioning (Summing Mutually Exclusive Cases)
Case 1: Exactly 3 teachers and 2 students ( 8 3 ) × ( 6 2 ) = ( 8 × 7 × 6 3 × 2 × 1 ) × ( 6 × 5 2 × 1 ) = 56 × 15 = 840 \binom{8}{3} \times \binom{6}{2} = \left(\frac{8 \times 7 \times 6}{3 \times 2 \times 1}\right) \times \left(\frac{6 \times 5}{2 \times 1}\right) = 56 \times 15 = 840 ( 3 8 ) × ( 2 6 ) = ( 3 × 2 × 1 8 × 7 × 6 ) × ( 2 × 1 6 × 5 ) = 56 × 15 = 840
Case 2: Exactly 4 teachers and 1 student ( 8 4 ) × ( 6 1 ) = ( 8 × 7 × 6 × 5 4 × 3 × 2 × 1 ) × 6 = 70 × 6 = 420 \binom{8}{4} \times \binom{6}{1} = \left(\frac{8 \times 7 \times 6 \times 5}{4 \times 3 \times 2 \times 1}\right) \times 6 = 70 \times 6 = 420 ( 4 8 ) × ( 1 6 ) = ( 4 × 3 × 2 × 1 8 × 7 × 6 × 5 ) × 6 = 70 × 6 = 420
Case 3: Exactly 5 teachers and 0 students ( 8 5 ) × ( 6 0 ) = ( 8 3 ) × 1 = 56 × 1 = 56 \binom{8}{5} \times \binom{6}{0} = \binom{8}{3} \times 1 = 56 \times 1 = 56 ( 5 8 ) × ( 0 6 ) = ( 3 8 ) × 1 = 56 × 1 = 56
Summing these disjoint cases: Total Favorable Committees = 840 + 420 + 56 = 1 , 316 \text{Total Favorable Committees} = 840 + 420 + 56 = 1,316 Total Favorable Committees = 840 + 420 + 56 = 1 , 316
Method 2: Complementary Counting Verification
Total Unconstrained Committees (choosing 5 from 14): ( 14 5 ) = 14 × 13 × 12 × 11 × 10 5 × 4 × 3 × 2 × 1 = 2 , 002 \binom{14}{5} = \frac{14 \times 13 \times 12 \times 11 \times 10}{5 \times 4 \times 3 \times 2 \times 1} = 2,002 ( 5 14 ) = 5 × 4 × 3 × 2 × 1 14 × 13 × 12 × 11 × 10 = 2 , 002
Unfavorable Committees (fewer than 3 teachers: 0, 1, or 2 teachers):
Exactly 0 teachers (5 students): ( 8 0 ) × ( 6 5 ) = 1 × 6 = 6 \binom{8}{0} \times \binom{6}{5} = 1 \times 6 = 6 ( 0 8 ) × ( 5 6 ) = 1 × 6 = 6
Exactly 1 teacher (4 students): ( 8 1 ) × ( 6 4 ) = 8 × 15 = 120 \binom{8}{1} \times \binom{6}{4} = 8 \times 15 = 120 ( 1 8 ) × ( 4 6 ) = 8 × 15 = 120
Exactly 2 teachers (3 students): ( 8 2 ) × ( 6 3 ) = 28 × 20 = 560 \binom{8}{2} \times \binom{6}{3} = 28 \times 20 = 560 ( 2 8 ) × ( 3 6 ) = 28 × 20 = 560 Total Unfavorable = 6 + 120 + 560 = 686 \text{Total Unfavorable} = 6 + 120 + 560 = 686 Total Unfavorable = 6 + 120 + 560 = 686
Subtracting Unfavorable from Total: Total Favorable = 2 , 002 − 686 = 1 , 316 \text{Total Favorable} = 2,002 - 686 = 1,316 Total Favorable = 2 , 002 − 686 = 1 , 316
Both analytic pathways yield exactly 1,316 distinct committee configurations .