Lecture

Number Theory: Operations and Equivalence

Related lectures (42)
Group Theory: Basics
Covers the basics of group theory, including definitions, examples, and isometries.
Relations in Computer Science
Explores the properties of relations in computer science, including equivalence relations and the partition of a set.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Cartesian Product and Induction
Introduces Cartesian product and induction for proofs using integers and sets.
Elementary Algebra: Numeric Sets
Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.
Logic and Proof Techniques
Covers integers, rationals, logic, proof techniques, functions, and relations using examples and truth tables.
Division in Rational Numbers
Explores division in rational numbers and the extension of addition from integers.
Rational Numbers: Construction and Properties
Covers the construction and properties of rational numbers, including fractions and equivalence, with proofs on commutativity.
Complexity & Induction: Algorithms & Proofs
Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.
Integers: Elementary Concepts
Covers fundamental concepts related to integers, including properties of well-ordered sets and the principle of induction.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.