Omniadisce

Applied maths 6.7: Mastery check — logic, proof and discrete mathematics

Lesson Intermediate

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

  1. How the mastery check works
  2. Deny the rule
  3. Negate 'there exists'
  4. Start the contradiction
  5. A sum by induction
  6. Neither
  7. Classify a function
  8. The first four places
  9. A mixed committee
  10. At least one 7
  11. Count the links
  12. An Euler route?
  13. The long-run level
  14. Characteristic roots
  15. From unit 5: drawing without replacement

Discussion 0 comments

Log in to join the discussion.

× Enlarged view