CSE 2023 • Final • Discrete Computational Structures

Definition of Divisibility

Example 1

Example 2

Example 3

Division Algorithm

Definition of Modular Arithmetic

Example 1

Properties of Modular Arithmetic

Example 1

Example 2

GCD Greatest Common Divisor

LCM Least Commun Multiple

Euclidian Algorithm

Example 1

Bézout Identity

Example 1

Example 2

Example 3

Inverse of a Number in Modular Arithmetic

Fermat's Little Theorem

Solving Linear Congruences

Example 1

Example 2

Chinese Remainder Theorem

Example 1

Example 2

Example 3

Example 4

Basic Principles of Counting

Counting Examples

Permutations

Permutations Example

Groups and Circular Permutation Example

Identical Objects Example 1

Identical Objects Example 2

Identical Objects Example 3

Combination

n choose r

Committee Example 1

Committee Example 2

Ball Example 1

Ball Example 2

Binomial Theorem

Example 1

Example 3

Example 2

Pascal Identity

Vandermonde's Identity

Example 1

Combinatorial Proof

Example 1

Principle Inclusion-Exclusion

Example 1

Example 2

Distributing Objects into Boxes

Example 1

Example 2

Example 3

Example 4

Example 5

Example 6

Pigeonhole Principle

Example 1

Example 2

Example 3

Example 4

Example 5

Example 6

Example 7

Counting 1

Counting 2

Counting 3

Counting 4

Counting 5

Counting 6

Counting 7

Inclusion-Exclusion Principle 1

Inclusion-Exclusion Principle 2

Inclusion-Exclusion Principle & Distributing Objects 1

Distributing Objects into Boxes 1

Distributing Objects into Boxes 2

Distributing Objects into Boxes 3

Distributing Objects into Boxes 4

Distributing Objects into Boxes 5

Distributing Objects into Boxes 6

Pigeonhole Principle 1

Pigeonhole Principle 2

Pigeonhole Principle 3

Pigeonhole Principle 4

Pigeonhole Principle 5

Number Theory 1

Number Theory 2

Number Theory 3

Number Theory 4

Number Theory 5

Number Theory 6

Number Theory 7

Number Theory 8

Number Theory 9

Number Theory 10

Number Theory 11

Number Theory 12

Definition of Relation

Example 1

Example 2

Example 3

Example 4

Reflexive Relations

Example 5

Example 6

Symmetric Relations

Antisymmetric Relations

Example 7

Transitive Relations

Example 8

Properties of Relations

Example 9

Example 10

Example 11

Example 12

Example 13

Example 14

Equivalence Relation

Example 15

Example 16

Example 17

Example 18

Example 19

Example 20

Example 21

Example 22

Example 23

Introduction

Example 1

Graph Terminology

Example 2

Handshaking Theorem

Example 3

Example 4

Special Graphs

Example 5

Example 6

Bipartite Graphs

Example 7

Example 8

Complete Bipartite Graph

Matching

Example 9

Subgraph

Example 10

Subgraph Induced

Edge Contraction

Example 11

Complementary Graph

Example 12

Example 13

Example 14

Adjacency Matrices - Undirected Graphs

Adjacency Matrices - Directed Graphs

Example 1

Example 2

Incidence Matrices

Example 3

Isomorphism of Graphs

Example 4

Example 5

Example 6

Example 7

Definition of Paths and Circuits

Connected Graphs

Euler Paths and Circuits

Example 8

Hamilton Paths and Circuits

Example 9

Example 10

Relations 1

Relations 2

Relations 3

Graphs 1

Graphs 2

Graphs 3

Graphs 4

Graphs 5

Graphs 6

Graphs 7

Graphs 8

Graphs 9

Graphs 10

Graphs 11

Graphs 12

Graphs 13

Graphs 14

Graphs 15

Graphs 16