Join free to take this lesson
Anyone can look around, but taking a lesson needs a free account. With one, your answers are checked step by step and your progress is saved, so you can stop and pick up where you left off on any device.
15 steps · about 25 min
By the end you can
- Negate statements and recognise valid proof steps
- Count with sets, arrangements, selections and complements
- Use degrees, Euler's rule and trees in networks
- Iterate and solve recurrences, and find long-run levels
Who it is for: You have worked through lessons 6.1-6.6.
The steps
- How the mastery check works
- Deny the rule
- Negate 'there exists'
- Start the contradiction
- A sum by induction
- Neither
- Classify a function
- The first four places
- A mixed committee
- At least one 7
- Count the links
- An Euler route?
- The long-run level
- Characteristic roots
- From unit 5: drawing without replacement
Discussion 0 comments
Log in to join the discussion.