CSCA.space
Launch Simulator
Home/Curriculum/Mathematics/Permutations, Combinations & Classical Probability
CSCA MathematicsChapter 4: Probability & StatisticsIntermediate

Permutations, Combinations & Classical Probability

排列组合与古典概型 · Node 4.1

Addition and multiplication counting principles, permutations $A_n^m = \frac{n!}{(n-m)!}$, combinations $C_n^m = \frac{n!}{m!(n-m)!}$, and equally likely outcomes.

Chapter Weight: 15% of official examination
Practice This Node

Core Mathematical Axiom

Formula Proof & Traps
Anm​=(n−m)!n!​,Cnm​=m!(n−m)!n!​,P(A)=n(Ω)n(A)​,P(A∣B)=P(B)P(AB)​
CSCA Exam Trap Alert

Confusing permutation (ordered) with combination (unordered) in selection problems.

Previous Lesson
Solid Geometry: Line-Plane Positional Relations & Volume
Next Lesson
Statistics: Mean, Variance & Normal Distribution