Study guide
12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık)
TR-YÖS 2026 — Türkiye Yurt Dışından Öğrenci Kabul Sınavı Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: TR-YÖS Overview, Eligibility & Admissions Strategy
1.1 Current TR-YÖS Identity, Two-Test Blueprint and Admissions 1.2 Candidate Eligibility, Blue Card (Mavi Kart), Dual Citizenship & Registration 1.3 ÖSYM Scoring Mathematics, the 0.5 Raw-Point Rule, 1/4 Penalty & 100-Minute Pacing
2 Chapter 2: Sayısal Yetenek — Number Series, Sequences & Cryptarithmetic
2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri) 2.2 Number Matrices, Row-Column Operations & Functional Input-Output Tables 2.3 Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators
3 Chapter 3: Sayısal Yetenek — Visual Series, Analogies & Odd-One-Out
3.1 Figural Series, Angular Rotations, Translations & Element-Counting Rules 3.2 Visual Analogies, Geometric Transformations & Proportion Mapping 3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)
4 Chapter 4: Sayısal Yetenek — Visual Matrices, Pattern Completion & Grid Logic
4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations 4.2 Pattern & Grid Completion (Şekil Tamamlama), Quarter-Tile Symmetry & Tessellations 4.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables
5 Chapter 5: Sayısal Yetenek — 3D Spatial Reasoning: Cubes, Folding & Reflections
5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma) 5.2 Cube Nets (Küp Açılımları), Opposite-Face Parities & 3D Die Rotations 5.3 Paper Folding & Hole Punching (Kağıt Katlama-Kesme), Mirror & Water Reflections
6 Chapter 6: Sayısal Yetenek — Balance Scales, Gears, Clocks & Calendar Logic
6.1 Balance Scales (Teraziler), Symbolic Weight Substitution & Inequality Scales 6.2 Meshed Gears (Çarklar), Concentric Pulleys, Belt Directions & Turn Ratios 6.3 Clock Hand Angles (Saat Problemleri), Modular Calendar Arithmetic & Compass Bearings
7 Chapter 7: Sayısal Yetenek — Data Interpretation, Grid Counting & Deductive Logic
7.1 Bar, Line and Pie Charts & Multi-Table Data Interpretation (Tablo ve Grafikler) 7.2 Grid Perimeter, Shaded Area, Sub-Shape Counting & Shortest Lattice Paths 7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles
8 Chapter 8: Temel Matematik — Number Systems, Base Arithmetic, Divisibility & Rationals
8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği) 8.2 Division Algorithm, Divisibility Rules, Prime Factorization, Divisors, EBOB (GCD) & EKOK (LCM) 8.3 Rational Numbers, Infinite/Telescoping Fractions & Repeating Decimals (Devirli Ondalık Sayılar)
9 Chapter 9: Temel Matematik — Exponents, Radicals, Factoring, Equations & Inequalities
9.1 Exponential Equations (Üslü Sayılar), Nested Radicals & Rationalizing Denominators 9.2 Algebraic Identities (Çarpanlara Ayırma), Sums and Differences of Cubes & Reciprocal Sums 9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)
10 Chapter 10: Temel Matematik — Ratios, Proportions & Classic Word Problems
10.1 Ratios, Direct/Inverse/Compound Proportions (Oran-Orantı) & Means 10.2 Number, Fraction, Age (Yaş) & Work/Pipe (İşçi-Havuz) Word Problems 10.3 Percentage, Profit-Loss (Kâr-Zarar), Mixture (Karışım) & Motion (Hareket) Problems
11 Chapter 11: Temel Matematik — Sets, Modular Operations, Functions, Polynomials & Quadratics
11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik) 11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations 11.3 Polynomials (Polinomlar), Quadratic Equations, Vieta's Formulas & Parabolas
12 Chapter 12: Temel Matematik — Logarithms, Complex Numbers, Combinatorics, Trigonometry & Calculus
12.1 Logarithms (Logaritma), Complex Numbers & Arithmetic/Geometric Sequences (Diziler) 12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık) 12.3 Trigonometry and Optional Calculus Enrichment
13 Chapter 13: Temel Matematik (Geometri) — Angles, Triangles, Similarity, Area & Polygons
13.1 Parallel-Line Angle Rules (Z, U, M, Kalem Ucu), Triangle Angles & Triangle Inequality 13.2 Right Triangles, Euclid's Altitude Laws, Angle Bisectors, Medians, Similarity & Area 13.3 Regular Polygons, Quadrilaterals, Parallelograms, Trapezoids, Rhombuses, Rectangles & Squares
14 Chapter 14: Temel Matematik (Geometri) — Circles, 3D Solids & Analytic Geometry
14.1 Circle Angles, Chords, Tangents, Power of a Point (Kuvvet) & Sector/Annulus Area 14.2 3D Solid Geometry (Katı Cisimler): Prisms, Cylinders, Pyramids, Cones & Spheres 14.3 Analytic Geometry (Analitik Geometri): Points, Lines, Slopes, Point-to-Line Distance & Circles
12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık)
Key Takeaways Explain This Topic AI
Use Permutations P(n, r) = n! / (n - r)! when order matters (arranging, seating, ranking) and Combinations C(n, r) = n! / (r!(n - r)!) when order does not matter (choosing committees, subsets, chords, or triangles).
Circular permutations of n distinct objects around a table equal (n - 1)!, while arrangements on a flip-symmetric keyring equal (n - 1)! / 2; permutations of n items with repetitions n_1, n_2, ..., n_k equal n! / (n_1! * n_2! * ... * n_k!).
From n points in a plane where k are collinear on a line d, the number of distinct triangles is C(n, 3) - C(k, 3) and the number of distinct lines is C(n, 2) - C(k, 2) + 1.
In the binomial expansion of (ax^p + by^q)^n, there are n + 1 terms and the general term is T_{r+1} = C(n, r) * (ax^p)^{n-r} * (by^q)^r; find the constant term (sabit terim) by setting the net exponent of x to 0, never by substituting x = 0 when reciprocal powers appear.
For probability, P(A U B) = P(A) + P(B) - P(A n B), independent events satisfy P(A n B) = P(A)P(B), conditional probability is P(A | B) = P(A n B) / P(B), and 'at least one' problems are fastest via 1 - P(none).
Last updated: October 2026
- 12.2 Permutations, Combinations, Binomial Expansion & Probability ( Olasılık )
- 1. Permutations ( Permütasyon — Order Matters)
- Fundamental Counting Principle & Linear Permutations
Addition Rule ( Toplama Yoluyla Sayma ): If disjoint tasks A A A and B B B can be done in m m m and n n n ways respectively, choosing one task OR ( veya ) the other can be done in m + n m + n m + n ways.
Multiplication Rule ( Çarpma Yoluyla Sayma ): If sequential stages A A A and B B B can be done in m m m and n n n ways, performing A A A AND ( ve ) B B B together can be done in m ⋅ n m \cdot n m ⋅ n ways.
Linear Permutations ( Sıralama ): The number of ordered arrangements of r r r items chosen from n n n distinct items is: P ( n , r ) = n ! ( n − r ) ! = n ( n − 1 ) ( n − 2 ) ⋯ ( n − r + 1 ) ⏟ r factors , P ( n , n ) = n ! P(n, r) = \frac{n!}{(n - r)!} = \underbrace{n(n - 1)(n - 2)\cdots(n - r + 1)}_{r \text{ factors}}, \qquad P(n, n) = n! P ( n , r ) = ( n − r )! n ! = r factors n ( n − 1 ) ( n − 2 ) ⋯ ( n − r + 1 ) , P ( n , n ) = n !
- (Recall 0 ! = 1 0! = 1 0 ! = 1 and 1 ! = 1 1! = 1 1 ! = 1 .)
- Block-Glue Method ( Paketleme Yöntemi ) vs. Gap-Insertion Method
Items that MUST stay together ( Yan Yana Olma Koşulu ): Tie the k k k items that must be adjacent into 1 single super-block ( paket ) . If there are m m m other free items, first arrange the ( m + 1 ) (m + 1) ( m + 1 ) units in ( m + 1 ) ! (m + 1)! ( m + 1 )! ways, then multiply by k ! k! k ! for the internal rearrangements inside the block: Total Ways = ( m + 1 ) ! ⋅ k ! \text{Total Ways} = (m + 1)! \cdot k! Total Ways = ( m + 1 )! ⋅ k !
Items that MUST NOT be adjacent ( Yan Yana Olmama Koşulu ): When only 2 items must stay apart, subtract the glued cases from total arrangements: n ! − ( n − 1 ) ! ⋅ 2 ! n! - (n-1)! \cdot 2! n ! − ( n − 1 )! ⋅ 2 ! . When 3 or more items of one group ( B B B ) cannot be adjacent, do not subtract from the total! Instead, use the gap-insertion method ( boşluk yöntemi ) : first seat the m m m unrestricted items ( A A A ) in m ! m! m ! ways, creating m + 1 m + 1 m + 1 gaps ( _ A _ A _ ... _ A _ ), then choose and order the k k k restricted items into those m + 1 m + 1 m + 1 gaps in P ( m + 1 , k ) P(m + 1, k) P ( m + 1 , k ) ways.
Circular Permutations ( Dairesel Permütasyon )
Around a Round Table ( Yuvarlak Masa ): Rotating everyone by one seat produces the same relative arrangement, so fix 1 person as a reference landmark and permute the remaining n − 1 n - 1 n − 1 people: P circle ( n ) = ( n − 1 ) ! P_{\text{circle}}(n) = (n - 1)! P circle ( n ) = ( n − 1 )!
On a Flip-Symmetric Keyring ( Maskotlu / Maskotsuz Anahtarlık ): A plain circular keyring without a fixed clasp can be flipped over in 3D space, making clockwise and counterclockwise orders identical: P keyring ( n ) = ( n − 1 ) ! 2 ( n ≥ 3 ) P_{\text{keyring}}(n) = \frac{(n - 1)!}{2} \quad (n \ge 3) P keyring ( n ) = 2 ( n − 1 )! ( n ≥ 3 )
Permutations with Repetition ( Tekrarlı Permütasyon )
The number of distinct permutations of n n n objects where n 1 n_1 n 1 are identical of type 1, n 2 n_2 n 2 are identical of type 2, ..., and n k n_k n k are identical of type k k k ( n 1 + n 2 + ⋯ + n k = n n_1 + n_2 + \dots + n_k = n n 1 + n 2 + ⋯ + n k = n ) is: n ! n 1 ! ⋅ n 2 ! ⋯ n k ! \frac{n!}{n_1! \cdot n_2! \cdots n_k!} n 1 ! ⋅ n 2 ! ⋯ n k ! n !
Leading-Zero Digit Rule: When forming an n n n -digit number using all n n n given digits where the digit 0 0 0 appears n 0 n_0 n 0 times, 0 0 0 cannot occupy the leftmost place. Multiply the total repeated permutation count by the fraction of non-zero digits: Valid n -digit numbers = n ! n 1 ! ⋅ n 2 ! ⋯ n k ! ⋅ n − n 0 n \text{Valid } n\text{-digit numbers} = \frac{n!}{n_1! \cdot n_2! \cdots n_k!} \cdot \frac{n - n_0}{n} Valid n -digit numbers = n 1 ! ⋅ n 2 ! ⋯ n k ! n ! ⋅ n n − n 0
Grid Shortest Paths: Walking on a rectangular grid from corner A A A to corner B B B using R R R steps Right and U U U steps Up is a repeated permutation of R R R identical R 's and U U U identical U 's: ( R + U ) ! R ! ⋅ U ! = ( R + U R ) \frac{(R + U)!}{R! \cdot U!} = \binom{R + U}{R} R ! ⋅ U ! ( R + U )! = ( R R + U ) .
- 2. Combinations ( Kombinasyon — Selection Without Order) & Binomial Theorem
- Core Combination Identities
The number of ways to select an unordered subset of r r r elements from n n n elements is: C ( n , r ) = ( n r ) = n ! r ! ( n − r ) ! C(n, r) = \binom{n}{r} = \frac{n!}{r!(n - r)!} C ( n , r ) = ( r n ) = r ! ( n − r )! n !
Symmetry Rule: ( n r ) = ( n n − r ) \binom{n}{r} = \binom{n}{n - r} ( r n ) = ( n − r n ) . Consequently, if ( n x ) = ( n y ) \binom{n}{x} = \binom{n}{y} ( x n ) = ( y n ) , then either x = y x = y x = y or x + y = n x + y = n x + y = n .
Pascal's Identity: ( n r ) + ( n r + 1 ) = ( n + 1 r + 1 ) \binom{n}{r} + \binom{n}{r + 1} = \binom{n + 1}{r + 1} ( r n ) + ( r + 1 n ) = ( r + 1 n + 1 ) .
Total Subsets Sum: ( n 0 ) + ( n 1 ) + ( n 2 ) + ⋯ + ( n n ) = 2 n \binom{n}{0} + \binom{n}{1} + \binom{n}{2} + \dots + \binom{n}{n} = 2^n ( 0 n ) + ( 1 n ) + ( 2 n ) + ⋯ + ( n n ) = 2 n .
Geometric Counting with Combinations
Given n n n points in a plane:
If no three points are collinear (e.g., n n n points on a circle), they determine ( n 2 ) \binom{n}{2} ( 2 n ) distinct lines and ( n 3 ) \binom{n}{3} ( 3 n ) triangles. The count ( n 4 ) \binom{n}{4} ( 4 n ) of convex quadrilaterals additionally requires the points to be in convex position, as with distinct points on a circle.
If k k k of the n n n points are collinear on a single line d d d (and the other n − k n - k n − k are in general position), any 3 points chosen solely from line d d d fail to form a triangle. Subtract the degenerate cases: Number of Triangles = ( n 3 ) − ( k 3 ) , Number of Distinct Lines = ( n 2 ) − ( k 2 ) + 1 \text{Number of Triangles} = \binom{n}{3} - \binom{k}{3}, \qquad \text{Number of Distinct Lines} = \binom{n}{2} - \binom{k}{2} + 1 Number of Triangles = ( 3 n ) − ( 3 k ) , Number of Distinct Lines = ( 2 n ) − ( 2 k ) + 1
Parallelograms from Parallel Lines: A grid of m m m parallel horizontal lines intersecting n n n parallel slanted lines forms ( m 2 ) ⋅ ( n 2 ) \binom{m}{2} \cdot \binom{n}{2} ( 2 m ) ⋅ ( 2 n ) parallelograms.
Binomial Theorem ( Binom Açılımı )
For the expansion of ( a x p + b y q ) n (ax^p + by^q)^n ( a x p + b y q ) n :
There are n + 1 n+1 n + 1 indexed terms before collecting like powers; distinct nonzero terms require nondegenerate coefficients and exponents.
Sum of coefficients ( Katsayılar Toplamı ): Substitute x = 1 , y = 1 x = 1, y = 1 x = 1 , y = 1 to get ( a + b ) n (a + b)^n ( a + b ) n .
General ( r + 1 ) (r + 1) ( r + 1 ) -th Term Formula: T r + 1 = ( n r ) ( a x p ) n − r ( b y q ) r T_{r+1} = \binom{n}{r} (ax^p)^{n-r} (by^q)^r T r + 1 = ( r n ) ( a x p ) n − r ( b y q ) r
Constant Term ( Sabit Terim ) Trap: For a polynomial expression, the constant term is found by setting x = 0 x = 0 x = 0 . However, in rational binomials such as ( 2 x 2 − 1 x ) n \left(2x^2 - \frac{1}{x}\right)^n ( 2 x 2 − x 1 ) n , substituting x = 0 x = 0 x = 0 causes division by zero! Instead, write the general term T r + 1 T_{r+1} T r + 1 , combine the powers of x x x into x p ( n − r ) + q r x^{p(n-r) + qr} x p ( n − r ) + q r , and solve p ( n − r ) + q r = 0 p(n - r) + qr = 0 p ( n − r ) + q r = 0 for r r r .
3. Probability ( Olasılık )
For an experiment with sample space E E E ( örnek uzay ) of equally likely outcomes and an event A A A ( olay ): P ( A ) = s ( A ) s ( E ) = Desired Outcomes ( I ˙ stenen Durum) All Possible Outcomes (T u ¨ m Durum) , 0 ≤ P ( A ) ≤ 1 P(A) = \frac{s(A)}{s(E)} = \frac{\text{Desired Outcomes (İstenen Durum)}}{\text{All Possible Outcomes (Tüm Durum)}}, \qquad 0 \le P(A) \le 1 P ( A ) = s ( E ) s ( A ) = All Possible Outcomes (T u ¨ m Durum) Desired Outcomes ( I ˙ stenen Durum) , 0 ≤ P ( A ) ≤ 1
Complement Rule ( Tümleyen ): P ( A ′ ) = 1 − P ( A ) P(A') = 1 - P(A) P ( A ′ ) = 1 − P ( A ) . Whenever a problem asks for the probability of "at least one ( en az bir )" , compute 1 − P ( none ) 1 - P(\text{none}) 1 − P ( none ) .
Union Rule ( Birleşim ): P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) . If A A A and B B B are mutually exclusive ( ayrık olaylar ) , P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 .
Independent Events ( Bağımsız Olaylar ): Two events that do not affect each other satisfy P ( A ∩ B ) = P ( A ) ⋅ P ( B ) P(A \cap B) = P(A) \cdot P(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B ) .
Conditional Probability ( Koşullu Olasılık ): The probability of A A A given that B B B has already occurred ("... bilindiğine göre") restricts the denominator to B B B : P ( A ∣ B ) = P ( A ∩ B ) P ( B ) = s ( A ∩ B ) s ( B ) P(A \mid B) = \frac{P(A \cap B)}{P(B)} = \frac{s(A \cap B)}{s(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) = s ( B ) s ( A ∩ B )
Summary Reference Table
Scenario Formula Key Condition
Linear Permutation P ( n , r ) = n ! ( n − r ) ! P(n, r) = \frac{n!}{(n-r)!} P ( n , r ) = ( n − r )! n ! Order matters (seating, codes, rankings)
Circular / Keyring Table: ( n − 1 ) ! (n-1)! \quad ( n − 1 )! Keyring: ( n − 1 ) ! 2 \frac{(n-1)!}{2} 2 ( n − 1 )! Keyring can be flipped in 3D
Repeated Permutation n ! n 1 ! n 2 ! ⋯ n k ! ⋅ n − n 0 n \frac{n!}{n_1! n_2! \cdots n_k!} \cdot \frac{n - n_0}{n} n 1 ! n 2 ! ⋯ n k ! n ! ⋅ n n − n 0 Include n − n 0 n \frac{n-n_0}{n} n n − n 0 when n 0 n_0 n 0 zeros cannot lead
Combination ( n r ) = n ! r ! ( n − r ) ! \binom{n}{r} = \frac{n!}{r!(n-r)!} ( r n ) = r ! ( n − r )! n ! Order does NOT matter (committees, geometry)
Collinear Triangles ( n 3 ) − ( k 3 ) \binom{n}{3} - \binom{k}{3} ( 3 n ) − ( 3 k ) k k k of the n n n points lie on the same line
Binomial Term T r + 1 = ( n r ) ( a x p ) n − r ( b y q ) r T_{r+1} = \binom{n}{r}(ax^p)^{n-r}(by^q)^r T r + 1 = ( r n ) ( a x p ) n − r ( b y q ) r Constant term: net exponent of x x x equals 0 0 0
Conditional Probability P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A \mid B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) Trigger phrase: "... olduğu bilindiğine göre"
- Worked Examples
- Worked Example 1: Repeated Permutation with Leading Zeros & Binomial Constant Term
Problem:
How many distinct 6 6 6 -digit numbers can be formed using all the digits of 202440 202440 202440 ?
Find the constant term ( sabit terim ) in the expansion of ( 2 x 2 − 1 x ) 6 \left(2x^2 - \frac{1}{x}\right)^6 ( 2 x 2 − x 1 ) 6 .
Step-by-Step Solution:
The 6 6 6 digits are { 2 , 0 , 2 , 4 , 4 , 0 } \{2, 0, 2, 4, 4, 0\} { 2 , 0 , 2 , 4 , 4 , 0 } : the digit 2 2 2 repeats 2 2 2 times, 4 4 4 repeats 2 2 2 times, and 0 0 0 repeats 2 2 2 times ( n = 6 , n 0 = 2 n = 6, n_0 = 2 n = 6 , n 0 = 2 ). Using the repeated permutation formula with the leading-zero fraction 6 − 2 6 = 4 6 \frac{6 - 2}{6} = \frac{4}{6} 6 6 − 2 = 6 4 : Count = 6 ! 2 ! ⋅ 2 ! ⋅ 2 ! ⋅ 4 6 = 720 8 ⋅ 2 3 = 90 ⋅ 2 3 = 60 \text{Count} = \frac{6!}{2! \cdot 2! \cdot 2!} \cdot \frac{4}{6} = \frac{720}{8} \cdot \frac{2}{3} = 90 \cdot \frac{2}{3} = 60 Count = 2 ! ⋅ 2 ! ⋅ 2 ! 6 ! ⋅ 6 4 = 8 720 ⋅ 3 2 = 90 ⋅ 3 2 = 60
Write the general ( r + 1 ) (r + 1) ( r + 1 ) -th term of ( 2 x 2 − x − 1 ) 6 \left(2x^2 - x^{-1}\right)^6 ( 2 x 2 − x − 1 ) 6 : T r + 1 = ( 6 r ) ( 2 x 2 ) 6 − r ( − x − 1 ) r = ( 6 r ) 2 6 − r ( − 1 ) r x 12 − 2 r − r = ( 6 r ) 2 6 − r ( − 1 ) r x 12 − 3 r T_{r+1} = \binom{6}{r} (2x^2)^{6-r} (-x^{-1})^r = \binom{6}{r} 2^{6-r} (-1)^r x^{12 - 2r - r} = \binom{6}{r} 2^{6-r} (-1)^r x^{12 - 3r} T r + 1 = ( r 6 ) ( 2 x 2 ) 6 − r ( − x − 1 ) r = ( r 6 ) 2 6 − r ( − 1 ) r x 12 − 2 r − r = ( r 6 ) 2 6 − r ( − 1 ) r x 12 − 3 r
Set the exponent of x x x equal to 0 0 0 : 12 − 3 r = 0 ⟹ r = 4 12 - 3r = 0 \implies r = 4 12 − 3 r = 0 ⟹ r = 4 . Substitute r = 4 r = 4 r = 4 : Constant Term = ( 6 4 ) ⋅ 2 6 − 4 ⋅ ( − 1 ) 4 = 15 ⋅ 4 ⋅ 1 = 60 \text{Constant Term} = \binom{6}{4} \cdot 2^{6-4} \cdot (-1)^4 = 15 \cdot 4 \cdot 1 = 60 Constant Term = ( 4 6 ) ⋅ 2 6 − 4 ⋅ ( − 1 ) 4 = 15 ⋅ 4 ⋅ 1 = 60
Worked Example 2: Geometric Combinations & Conditional Probability
Problem:
In a plane, 9 9 9 points are given such that 4 4 4 of them lie on a straight line d d d , and the remaining 5 5 5 points lie on a circle (with no other collinear triples). How many triangles can be formed using these 9 9 9 points as vertices?
Two fair dice are rolled and it is known that the sum of the top faces is 8 8 8 . What is the probability that at least one of the dice shows a 3 3 3 ?
Step-by-Step Solution:
Choosing any 3 3 3 points out of 9 9 9 gives ( 9 3 ) \binom{9}{3} ( 3 9 ) triples, while choosing 3 3 3 collinear points from line d d d gives ( 4 3 ) \binom{4}{3} ( 3 4 ) degenerate triples: Triangles = ( 9 3 ) − ( 4 3 ) = 9 ⋅ 8 ⋅ 7 3 ⋅ 2 ⋅ 1 − 4 = 84 − 4 = 80 \text{Triangles} = \binom{9}{3} - \binom{4}{3} = \frac{9 \cdot 8 \cdot 7}{3 \cdot 2 \cdot 1} - 4 = 84 - 4 = 80 Triangles = ( 3 9 ) − ( 3 4 ) = 3 ⋅ 2 ⋅ 1 9 ⋅ 8 ⋅ 7 − 4 = 84 − 4 = 80
Let B B B be the given condition that the sum of the two dice is 8 8 8 : B = { ( 2 , 6 ) , ( 3 , 5 ) , ( 4 , 4 ) , ( 5 , 3 ) , ( 6 , 2 ) } B = \{(2,6), (3,5), (4,4), (5,3), (6,2)\} B = {( 2 , 6 ) , ( 3 , 5 ) , ( 4 , 4 ) , ( 5 , 3 ) , ( 6 , 2 )} , so s ( B ) = 5 s(B) = 5 s ( B ) = 5 . Let A A A be the event that at least one die is a 3 3 3 . Then A ∩ B = { ( 3 , 5 ) , ( 5 , 3 ) } A \cap B = \{(3,5), (5,3)\} A ∩ B = {( 3 , 5 ) , ( 5 , 3 )} , so s ( A ∩ B ) = 2 s(A \cap B) = 2 s ( A ∩ B ) = 2 . Thus: P ( A ∣ B ) = s ( A ∩ B ) s ( B ) = 2 5 P(A \mid B) = \frac{s(A \cap B)}{s(B)} = \frac{2}{5} P ( A ∣ B ) = s ( B ) s ( A ∩ B ) = 5 2
Conditional probability requires P ( B ) > 0 P(B)>0 P ( B ) > 0 . The circular counts assume distinct objects and that rotations are equivalent; labelled fixed seats change the count. A flip-symmetric keyring additionally identifies reversed cyclic orders and uses the displayed halving formula for n ≥ 3 n\ge3 n ≥ 3 .
Review the Method
For probability, P(A U B) = P(A) + P(B) - P(A n B), independent events satisfy P(A n B) = P(A)P(B), conditional probability is P(A | B) = P(A n B) / P(B), and 'at least one' problems are fastest via 1 - P(none).