Explore sets, logic, counting principles, and graph theory. Learn fundamental discrete structures and their applications in computer science, optimization, and problem-solving.
Perform set operations!
Given:
Find: A ∪ B
Calculate permutations or combinations!
Given:
Find: C(5, 3)
A set is a well-defined collection of distinct objects. Sets are fundamental to discrete mathematics and form the foundation for many mathematical structures.
Roster notation: A = {1, 2, 3} (list elements)
Set-builder: A =
Cardinality: |A| = number of elements in A
Empty set: ∅ = {} (set with no elements)
Given: A = {1, 2, 3}, B = {3, 4, 5}
Union: A ∪ B = {1, 2, 3, 4, 5} (all elements)
Intersection: A ∩ B = {3} (common elements)
Difference: A - B = {1, 2} (in A but not in B)