Combinatorics
19 covered of 19 dot points
Lessons
- Counting and Arrangements
Listing outcomes, the multiplication principle, factorial notation, arrangements in a line and around a circle, and arrangements when some items are identical.
45 min
- The Pigeonhole Principle
The pigeonhole principle and its generalisation, a proof by contradiction, and how to choose pigeonholes to prove results about numbers, points and people.
35 min
- Permutations and Combinations
Ordered selections with nPr, unordered selections with nCr, problems with restrictions and repeated objects, and using counting to find probabilities.
50 min
- Binomial Expansions and Pascal's Triangle
Expanding (x + y)^n for small n, the link between the coefficients of (1 + x)^n, Pascal's triangle and nCr, and algebraic and combinatorial proofs of Pascal's triangle identities.
45 min
175 minutes of reading, in syllabus order.
What the syllabus asks
ME-A1 Working with Combinatorics
list and count the number of ways an event can occur
taught and practised · 2 questions · Counting and Arrangements
use the fundamental counting principle (also known as the multiplication principle)
taught and practised · 6 questions · Counting and Arrangements
use factorial notation to describe and determine the number of ways different items can be arranged in a line or a circle
taught and practised · 11 questions · Counting and Arrangements
solve problems involving cases where some items are not distinct (excluding arrangements in a circle)
taught and practised · 6 questions · Counting and Arrangements
solve simple problems and prove results using the pigeonhole principle (ACMSM006)ACMSM006
taught and practised · 12 questions · The Pigeonhole Principle
understand that if there are pigeonholes and pigeons to go into them, then at least one pigeonhole must hold 2 or more pigeons
taught and practised · 5 questions · The Pigeonhole Principle
generalise to: If pigeons are sitting in pigeonholes, where , then there is at least one pigeonhole with at least pigeons in it
taught and practised · 7 questions · The Pigeonhole Principle
prove the pigeonhole principle
taught and practised · 2 questions · The Pigeonhole Principle
understand and use permutations to solve problems (ACMSM001)ACMSM001
taught and practised · 2 questions · Permutations and Combinations
understand and use the notation and the formula
taught and practised · 2 questions · Permutations and Combinations
solve problems involving permutations and restrictions with or without repeated objects (ACMSM004)ACMSM004
taught and practised · 2 questions · Permutations and Combinations
understand and use combinations to solve problems (ACMSM007)ACMSM007
taught and practised · 7 questions · Permutations and Combinations
understand and use the notations and and the formula (ACMMM045, ACMSM008)ACMMM045 ACMSM008
taught and practised · 4 questions · Permutations and Combinations
solve practical problems involving permutations and combinations, including those involving simple probability situations AAM
taught and practised · 10 questions · Permutations and Combinations
expand for small positive integers (ACMMM046)ACMMM046
taught and practised · 9 questions · Binomial Expansions and Pascal's Triangle
note the pattern formed by the coefficients of in the expansion of and recognise links to Pascal’s triangle
taught and practised · 3 questions · Binomial Expansions and Pascal's Triangle
recognise the numbers (also denoted ) as binomial coefficients (ACMMM047)ACMMM047
taught and practised · 5 questions · Binomial Expansions and Pascal's Triangle
derive and use simple identities associated with Pascal’s triangle (ACMSM009)ACMSM009
taught and practised · 6 questions · Binomial Expansions and Pascal's Triangle
establish combinatorial proofs of the Pascal’s triangle relations ; for ; and
taught and practised · 3 questions · Binomial Expansions and Pascal's Triangle
Wording is the official syllabus, read from the NESA document by a parser. The full document.