External
Discrete Math with SageMath
This book is intended to provide concise and complete instructions on how to use Sage to solve problems in Discrete Math for a first or second year undergraduate course for math and computer science majors. Our goal is to streamline the learning process with SageMath. This approach helps students focus more on mathematics and reduces the friction of learning how to code. This is a student-created textbook (Open Pedagogy) for more effective alternative in student learning and engagement.
- Author
- Hellen Colman
- Publisher
- City Colleges of Chicago
- Source
- LibreTexts
- License
- CC BY
- Language
- EN
- Category
- Basic Sciences
Contents· 55 sections
- 01: Getting Started
- 1.01: Intro to Sage
- 1.02: Data Types
- 1.03: Flow Control Structures
- 1.04: Defining Functions
- 1.05: Object-Oriented Programming
- 1.06: Display Values
- 1.07: Debugging
- 1.08: Documentation
- 1.09: Miscellaneous Features
- 1.10: Run Sage in the browser
- 02: Set Theory
- 2.01: Creating Sets
- 2.02: Cardinality
- 2.03: Operations on Sets
- 03: Combinatorics
- 3.01: Combinatorics
- 04: Logic
- 4.01: Logical Operators
- 4.02: Truth Tables
- 4.03: Analyzing Logical Equivalences
- 05: Relations
- 5.01: Introduction to Relations
- 5.02: Digraphs
- 5.03: Properties
- 5.04: Equivalence
- 5.05: Partial Order
- 5.06: Relations in Action
- 06: Functions
- 6.01: Functions
- 6.02: Recursion
- 07: Graph Theory
- 7.01: Basics
- 7.02: Plot Options
- 7.03: Paths
- 7.04: Isomorphism
- 7.05: Euler and Hamilton
- 7.06: Graphs in Action
- 08: Trees
- 8.01: Definitions and Theorems
- 8.02: Search Algorithms
- 8.03: Trees in Action
- 09: Lattices
- 9.01: Lattices
- 9.02: Tables of Operations
- 10: Boolean Algebra
- 10.01: Boolean Algebra
- 10.02: Boolean functions
- 11: Logic Gates
- 11.01: Logic Gates
- 11.02: Combinations of Logic Gates
- 12: Finite State Machines
- 12.01: Definitions and Components
- 12.02: Finite State Machines in Sage
- 12.03: State Machine in Action