Poland Liceum ogólnokształcące, klasa IV Mathematics
Chapters: 3
1. Combinatorics
Counting
- Permutations and Combinations – Counting without listing is the heart of this chapter. The fundamental principle of counting says: if one job can be done in m ways and the next in n ways, both together can be done in m × n ways. n! (n factorial) is 1 × 2 × … × n, with 0! = 1. A permutation is an arrangement, where order matters: the number of ways to arrange r things out of n different things is ⁿPᵣ = n!/(n − r)!. A combination is a selection, where order does not matter: ⁿCᵣ = n!/(r!(n − r)!). Each selection of r things can be arranged in r! ways, so ⁿPᵣ = ⁿCᵣ × r!. Useful facts: ⁿCᵣ = ⁿCₙ₋ᵣ and ⁿCᵣ + ⁿCᵣ₋₁ = ⁿ⁺¹Cᵣ. When some objects repeat, divide by the factorial of each repeat count.
2. Probability and statistics
Probability and averages
- Probability: Events, Algebra of Events and Axioms – An event is any subset of the sample space S. From events A and B we build new events: not A (A′), A and B (A ∩ B), A or B (A ∪ B). Events are mutually exclusive if they share no outcome and exhaustive if together they cover S. The axiomatic approach says every P(E) ≥ 0, P(S) = 1, and for mutually exclusive A, B, P(A ∪ B) = P(A) + P(B). From these follow P(A′) = 1 − P(A) and P(A ∪ B) = P(A) + P(B) − P(A ∩ B).
3. Optimisation and calculus
Optimisation with quadratics
- Optimisation: Finding the Best Value with Quadratics – Optimisation means finding the best value: the biggest area, the largest profit or the smallest cost. We write the quantity as a quadratic function, then the vertex of its parabola gives the best value. For y = ax² + bx + c the vertex is at x = −b/(2a); if a < 0 it is a maximum, if a > 0 it is a minimum.