Understand statements, truth tables, and how to construct valid mathematical proofs (direct, contrapositive, contradiction, and induction).
Learn about sets, subsets, intersections, unions, complements, and Venn diagrams.
Explore mappings, domain and range, one-to-one and onto functions, equivalence relations, and partial orderings.
Master permutations, combinations, the Pigeonhole Principle, and basic counting principles.
Study divisibility, prime numbers, greatest common divisors, and modular arithmetic.
Understand vertices, edges, paths, cycles, and applications of graphs in problem-solving.
Learn how algorithms work, how to analyze their efficiency, and understand Big-O notation.
Solve problems using recursive definitions and find closed forms for recurrence relations
Learn logic, proof techniques, set theory, functions, and relations to build a strong problem-solving base.
Master counting principles, permutations, combinations, the Pigeonhole Principle, divisibility, primes, and modular arithmetic.
Explore graph theory, recursion, recurrence relations, algorithms, efficiency, and Big-O complexity for real-world applications.
Cascer © 2020 All Rights Reserved
