shipslides
Math32 slides0 views

Discrete Mathematics

The mathematics of objects you can count.

Standalone
Sandboxed deck
Open raw

About this HTML presentation

This Shipslides page presents Discrete Mathematics as an interactive HTML presentation deck in the Mathematics catalog with 32 slides. The share page keeps the uploaded deck sandboxed while exposing readable context, topics, and a slide outline for viewers and search engines.

The mathematics of objects you can count. Key sections include: Discrete math.; // 01 — Opening What discrete math is.; // 02 — Foundation Sets.; // 03 — Maps Functions.; // 04 — Structure Relations.; // 05 — Combinatorics The art of counting.; // 06 — Permutation & combination Order matters, sometimes.; // 07 — Encoding sequences Generating functions.; // 08 — Self-reference Recurrence relations.; // 09 — Networks Graph theory..

Key sections

  • 01Discrete math.
  • 02// 01 — Opening What discrete math is.
  • 03// 02 — Foundation Sets.
  • 04// 03 — Maps Functions.
  • 05// 04 — Structure Relations.
  • 06// 05 — Combinatorics The art of counting.
  • 07// 06 — Permutation & combination Order matters, sometimes.
  • 08// 07 — Encoding sequences Generating functions.

Topics covered

mathematicsdiscretemath
Slide outline
  1. 01Discrete math.
  2. 02// 01 — Opening What discrete math is.
  3. 03// 02 — Foundation Sets.
  4. 04// 03 — Maps Functions.
  5. 05// 04 — Structure Relations.
  6. 06// 05 — Combinatorics The art of counting.
  7. 07// 06 — Permutation & combination Order matters, sometimes.
  8. 08// 07 — Encoding sequences Generating functions.
  9. 09// 08 — Self-reference Recurrence relations.
  10. 10// 09 — Networks Graph theory.
  11. 11// 10 — Founding problem Eulerian paths.
  12. 12// 11 — Procedures on graphs Graph algorithms.
  13. 13// 12 — Acyclic graphs Trees.
  14. 14// 13 — On the page Planar graphs.
  15. 15// 14 — A controversy The four-color theorem.
  16. 16// 15 — Number theory Modular arithmetic.
  17. 17// 16 — Chance on finite spaces Discrete probability.
  18. 18// 17 — Combinatorial games Two-player perfect-information.
  19. 19// 18 — Algebra of {0, 1} Boolean algebra.
  20. 20// 19 — Hardware Logic gates.
  21. 21// 20 — Procedures Algorithm design.
  22. 22// 21 — Asymptotic analysis Big-O notation.
  23. 23// 22 — Order n elements Sorting algorithms.
  24. 24// 23 — Discrete secrets Cryptography preview.
  25. 25// 24 — Detecting errors Coding theory.
  26. 26// 25 — A specific code Hamming codes.
  27. 27// 26 — Discrete & combinatorial Discrete optimisation.
  28. 28// 27 — Convex relaxation Linear programming.
  29. 29// 28 — Library Reading list.
  30. 30// 29 — Watch Watch & read.
  31. 31// 30 — Constants The constants.
  32. 32The end of the deck.
Page data
Canonical
https://shipslides.com/d/mathematics-discrete-math
Category
Mathematics
Size
327.1 KB
Updated
2026-05-17
LLM text
https://shipslides.com/d/mathematics-discrete-math/llms.txt
Remove this deck